./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:19:49,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:19:49,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:19:49,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:19:49,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:19:49,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:19:49,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:19:49,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:19:49,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:19:49,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:19:49,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:19:49,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:19:49,673 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:19:49,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:19:49,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:19:49,675 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:19:49,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:19:49,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:19:49,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:19:49,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:19:49,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:19:49,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:19:49,681 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:19:49,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:19:49,682 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:19:49,682 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:19:49,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:19:49,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:19:49,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:19:49,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:19:49,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:19:49,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:19:49,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:19:49,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:19:49,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:19:49,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:19:49,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:19:49,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:19:49,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:19:49,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:19:49,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:19:49,686 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 [2024-10-11 17:19:49,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:19:49,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:19:49,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:19:49,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:19:49,978 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:19:49,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2024-10-11 17:19:51,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:19:51,617 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:19:51,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2024-10-11 17:19:51,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b273991af/0fcc25fab4924f05b41a5e28ab7ceb6a/FLAG7102fc6a0 [2024-10-11 17:19:51,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b273991af/0fcc25fab4924f05b41a5e28ab7ceb6a [2024-10-11 17:19:51,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:19:51,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:19:51,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:19:51,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:19:51,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:19:51,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:19:51" (1/1) ... [2024-10-11 17:19:51,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2708d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:51, skipping insertion in model container [2024-10-11 17:19:51,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:19:51" (1/1) ... [2024-10-11 17:19:51,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:19:52,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:19:52,103 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:19:52,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:19:52,196 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:19:52,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52 WrapperNode [2024-10-11 17:19:52,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:19:52,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:19:52,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:19:52,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:19:52,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (1/1) ... [2024-10-11 17:19:52,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (1/1) ... [2024-10-11 17:19:52,254 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 173 [2024-10-11 17:19:52,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:19:52,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:19:52,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:19:52,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:19:52,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (1/1) ... [2024-10-11 17:19:52,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (1/1) ... [2024-10-11 17:19:52,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (1/1) ... [2024-10-11 17:19:52,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (1/1) ... [2024-10-11 17:19:52,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (1/1) ... [2024-10-11 17:19:52,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (1/1) ... [2024-10-11 17:19:52,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (1/1) ... [2024-10-11 17:19:52,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (1/1) ... [2024-10-11 17:19:52,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:19:52,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:19:52,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:19:52,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:19:52,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (1/1) ... [2024-10-11 17:19:52,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:19:52,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:19:52,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:19:52,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:19:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:19:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:19:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:19:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:19:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:19:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:19:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:19:52,455 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-10-11 17:19:52,455 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-10-11 17:19:52,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:19:52,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-11 17:19:52,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-11 17:19:52,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:19:52,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:19:52,457 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:19:52,662 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:19:52,664 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:19:53,037 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:19:53,038 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:19:53,073 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:19:53,074 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 17:19:53,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:19:53 BoogieIcfgContainer [2024-10-11 17:19:53,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:19:53,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:19:53,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:19:53,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:19:53,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:19:51" (1/3) ... [2024-10-11 17:19:53,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f9777e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:19:53, skipping insertion in model container [2024-10-11 17:19:53,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:52" (2/3) ... [2024-10-11 17:19:53,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f9777e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:19:53, skipping insertion in model container [2024-10-11 17:19:53,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:19:53" (3/3) ... [2024-10-11 17:19:53,080 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter.i [2024-10-11 17:19:53,092 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:19:53,093 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-10-11 17:19:53,093 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:19:53,170 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:19:53,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 376 transitions, 766 flow [2024-10-11 17:19:53,380 INFO L124 PetriNetUnfolderBase]: 21/495 cut-off events. [2024-10-11 17:19:53,381 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:19:53,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 495 events. 21/495 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 926 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 378. Up to 6 conditions per place. [2024-10-11 17:19:53,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 367 places, 376 transitions, 766 flow [2024-10-11 17:19:53,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 297 places, 302 transitions, 614 flow [2024-10-11 17:19:53,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:19:53,429 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;@46a7be89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:19:53,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-10-11 17:19:53,439 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:19:53,440 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2024-10-11 17:19:53,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:19:53,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:53,441 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] [2024-10-11 17:19:53,442 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-10-11 17:19:53,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1237391255, now seen corresponding path program 1 times [2024-10-11 17:19:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:53,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625199476] [2024-10-11 17:19:53,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:53,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:53,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:53,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625199476] [2024-10-11 17:19:53,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625199476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:53,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:53,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:53,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198188470] [2024-10-11 17:19:53,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:53,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:53,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:53,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:53,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:53,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 376 [2024-10-11 17:19:53,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 302 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-10-11 17:19:53,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:53,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 376 [2024-10-11 17:19:53,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:54,832 INFO L124 PetriNetUnfolderBase]: 654/4202 cut-off events. [2024-10-11 17:19:54,832 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-11 17:19:54,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5238 conditions, 4202 events. 654/4202 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 33301 event pairs, 489 based on Foata normal form. 182/3697 useless extension candidates. Maximal degree in co-relation 5101. Up to 1006 conditions per place. [2024-10-11 17:19:54,906 INFO L140 encePairwiseOnDemand]: 366/376 looper letters, 28 selfloop transitions, 2 changer transitions 1/292 dead transitions. [2024-10-11 17:19:54,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 292 transitions, 654 flow [2024-10-11 17:19:54,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2024-10-11 17:19:54,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9086879432624113 [2024-10-11 17:19:54,937 INFO L175 Difference]: Start difference. First operand has 297 places, 302 transitions, 614 flow. Second operand 3 states and 1025 transitions. [2024-10-11 17:19:54,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 292 transitions, 654 flow [2024-10-11 17:19:54,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 292 transitions, 653 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:19:54,950 INFO L231 Difference]: Finished difference. Result has 294 places, 291 transitions, 595 flow [2024-10-11 17:19:54,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=294, PETRI_TRANSITIONS=291} [2024-10-11 17:19:54,957 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -3 predicate places. [2024-10-11 17:19:54,958 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 291 transitions, 595 flow [2024-10-11 17:19:54,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-10-11 17:19:54,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:54,960 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] [2024-10-11 17:19:54,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:19:54,961 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-10-11 17:19:54,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash -824548405, now seen corresponding path program 1 times [2024-10-11 17:19:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:54,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556464136] [2024-10-11 17:19:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:55,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:55,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556464136] [2024-10-11 17:19:55,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556464136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:55,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:55,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:55,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428412933] [2024-10-11 17:19:55,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:55,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:55,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:55,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:55,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:55,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 376 [2024-10-11 17:19:55,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 291 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 320.0) internal successors, (960), 3 states have internal predecessors, (960), 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-10-11 17:19:55,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:55,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 376 [2024-10-11 17:19:55,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:55,900 INFO L124 PetriNetUnfolderBase]: 747/4645 cut-off events. [2024-10-11 17:19:55,900 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-11 17:19:55,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5832 conditions, 4645 events. 747/4645 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 37945 event pairs, 571 based on Foata normal form. 0/3925 useless extension candidates. Maximal degree in co-relation 5770. Up to 1153 conditions per place. [2024-10-11 17:19:55,927 INFO L140 encePairwiseOnDemand]: 368/376 looper letters, 31 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2024-10-11 17:19:55,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 645 flow [2024-10-11 17:19:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 996 transitions. [2024-10-11 17:19:55,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-10-11 17:19:55,930 INFO L175 Difference]: Start difference. First operand has 294 places, 291 transitions, 595 flow. Second operand 3 states and 996 transitions. [2024-10-11 17:19:55,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 645 flow [2024-10-11 17:19:55,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 284 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:55,937 INFO L231 Difference]: Finished difference. Result has 286 places, 284 transitions, 579 flow [2024-10-11 17:19:55,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=286, PETRI_TRANSITIONS=284} [2024-10-11 17:19:55,939 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -11 predicate places. [2024-10-11 17:19:55,939 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 284 transitions, 579 flow [2024-10-11 17:19:55,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.0) internal successors, (960), 3 states have internal predecessors, (960), 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-10-11 17:19:55,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:55,939 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] [2024-10-11 17:19:55,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:19:55,940 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-10-11 17:19:55,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1235349843, now seen corresponding path program 1 times [2024-10-11 17:19:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166303175] [2024-10-11 17:19:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:55,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:56,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166303175] [2024-10-11 17:19:56,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166303175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:56,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:56,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:56,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890768981] [2024-10-11 17:19:56,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:56,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:56,054 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 376 [2024-10-11 17:19:56,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 284 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 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-10-11 17:19:56,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:56,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 376 [2024-10-11 17:19:56,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:56,540 INFO L124 PetriNetUnfolderBase]: 709/4432 cut-off events. [2024-10-11 17:19:56,540 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-10-11 17:19:56,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5566 conditions, 4432 events. 709/4432 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 36699 event pairs, 546 based on Foata normal form. 0/3756 useless extension candidates. Maximal degree in co-relation 5504. Up to 1102 conditions per place. [2024-10-11 17:19:56,579 INFO L140 encePairwiseOnDemand]: 373/376 looper letters, 24 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2024-10-11 17:19:56,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 283 transitions, 629 flow [2024-10-11 17:19:56,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1026 transitions. [2024-10-11 17:19:56,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9095744680851063 [2024-10-11 17:19:56,583 INFO L175 Difference]: Start difference. First operand has 286 places, 284 transitions, 579 flow. Second operand 3 states and 1026 transitions. [2024-10-11 17:19:56,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 283 transitions, 629 flow [2024-10-11 17:19:56,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 283 transitions, 628 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:19:56,586 INFO L231 Difference]: Finished difference. Result has 286 places, 283 transitions, 580 flow [2024-10-11 17:19:56,587 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=286, PETRI_TRANSITIONS=283} [2024-10-11 17:19:56,588 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -11 predicate places. [2024-10-11 17:19:56,588 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 283 transitions, 580 flow [2024-10-11 17:19:56,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 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-10-11 17:19:56,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:56,590 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] [2024-10-11 17:19:56,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:19:56,591 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-10-11 17:19:56,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:56,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2001354401, now seen corresponding path program 1 times [2024-10-11 17:19:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:56,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515871458] [2024-10-11 17:19:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:56,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:56,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515871458] [2024-10-11 17:19:56,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515871458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:56,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:56,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230648415] [2024-10-11 17:19:56,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:56,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:56,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:56,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:56,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:56,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 376 [2024-10-11 17:19:56,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 283 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 333.3333333333333) internal successors, (1000), 3 states have internal predecessors, (1000), 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-10-11 17:19:56,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:56,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 376 [2024-10-11 17:19:56,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:57,213 INFO L124 PetriNetUnfolderBase]: 835/4303 cut-off events. [2024-10-11 17:19:57,214 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-11 17:19:57,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5601 conditions, 4303 events. 835/4303 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 33885 event pairs, 605 based on Foata normal form. 0/3668 useless extension candidates. Maximal degree in co-relation 5539. Up to 1258 conditions per place. [2024-10-11 17:19:57,243 INFO L140 encePairwiseOnDemand]: 373/376 looper letters, 24 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-10-11 17:19:57,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 282 transitions, 630 flow [2024-10-11 17:19:57,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1023 transitions. [2024-10-11 17:19:57,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069148936170213 [2024-10-11 17:19:57,247 INFO L175 Difference]: Start difference. First operand has 286 places, 283 transitions, 580 flow. Second operand 3 states and 1023 transitions. [2024-10-11 17:19:57,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 282 transitions, 630 flow [2024-10-11 17:19:57,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 282 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:57,252 INFO L231 Difference]: Finished difference. Result has 285 places, 282 transitions, 578 flow [2024-10-11 17:19:57,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=285, PETRI_TRANSITIONS=282} [2024-10-11 17:19:57,254 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -12 predicate places. [2024-10-11 17:19:57,254 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 282 transitions, 578 flow [2024-10-11 17:19:57,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.3333333333333) internal successors, (1000), 3 states have internal predecessors, (1000), 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-10-11 17:19:57,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:57,255 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] [2024-10-11 17:19:57,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:19:57,256 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-10-11 17:19:57,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash -671291987, now seen corresponding path program 1 times [2024-10-11 17:19:57,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:57,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771446837] [2024-10-11 17:19:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:57,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:57,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771446837] [2024-10-11 17:19:57,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771446837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:57,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:57,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:57,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835291390] [2024-10-11 17:19:57,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:57,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:57,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:57,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:57,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:57,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 376 [2024-10-11 17:19:57,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 282 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-10-11 17:19:57,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:57,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 376 [2024-10-11 17:19:57,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:57,948 INFO L124 PetriNetUnfolderBase]: 991/4536 cut-off events. [2024-10-11 17:19:57,948 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-11 17:19:57,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 4536 events. 991/4536 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 36414 event pairs, 713 based on Foata normal form. 0/3876 useless extension candidates. Maximal degree in co-relation 5991. Up to 1475 conditions per place. [2024-10-11 17:19:57,973 INFO L140 encePairwiseOnDemand]: 373/376 looper letters, 26 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-10-11 17:19:57,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 281 transitions, 632 flow [2024-10-11 17:19:57,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1019 transitions. [2024-10-11 17:19:57,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9033687943262412 [2024-10-11 17:19:57,975 INFO L175 Difference]: Start difference. First operand has 285 places, 282 transitions, 578 flow. Second operand 3 states and 1019 transitions. [2024-10-11 17:19:57,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 281 transitions, 632 flow [2024-10-11 17:19:57,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 281 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:57,979 INFO L231 Difference]: Finished difference. Result has 284 places, 281 transitions, 576 flow [2024-10-11 17:19:57,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=284, PETRI_TRANSITIONS=281} [2024-10-11 17:19:57,982 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -13 predicate places. [2024-10-11 17:19:57,982 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 281 transitions, 576 flow [2024-10-11 17:19:57,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-10-11 17:19:57,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:57,983 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] [2024-10-11 17:19:57,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:19:57,983 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-10-11 17:19:57,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash 827617098, now seen corresponding path program 1 times [2024-10-11 17:19:57,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:57,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537785059] [2024-10-11 17:19:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:57,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:58,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:58,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537785059] [2024-10-11 17:19:58,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537785059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:58,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:58,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:58,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353854391] [2024-10-11 17:19:58,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:58,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:58,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:58,088 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 376 [2024-10-11 17:19:58,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 281 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 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-10-11 17:19:58,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:58,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 376 [2024-10-11 17:19:58,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:58,651 INFO L124 PetriNetUnfolderBase]: 1451/5051 cut-off events. [2024-10-11 17:19:58,651 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-10-11 17:19:58,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7245 conditions, 5051 events. 1451/5051 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 39310 event pairs, 507 based on Foata normal form. 0/4471 useless extension candidates. Maximal degree in co-relation 7184. Up to 2100 conditions per place. [2024-10-11 17:19:58,679 INFO L140 encePairwiseOnDemand]: 368/376 looper letters, 38 selfloop transitions, 3 changer transitions 0/289 dead transitions. [2024-10-11 17:19:58,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 289 transitions, 679 flow [2024-10-11 17:19:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2024-10-11 17:19:58,682 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-10-11 17:19:58,682 INFO L175 Difference]: Start difference. First operand has 284 places, 281 transitions, 576 flow. Second operand 3 states and 1012 transitions. [2024-10-11 17:19:58,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 289 transitions, 679 flow [2024-10-11 17:19:58,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 289 transitions, 675 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:58,686 INFO L231 Difference]: Finished difference. Result has 280 places, 279 transitions, 583 flow [2024-10-11 17:19:58,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=280, PETRI_TRANSITIONS=279} [2024-10-11 17:19:58,687 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -17 predicate places. [2024-10-11 17:19:58,687 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 279 transitions, 583 flow [2024-10-11 17:19:58,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 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-10-11 17:19:58,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:58,688 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] [2024-10-11 17:19:58,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:19:58,688 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-10-11 17:19:58,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:58,689 INFO L85 PathProgramCache]: Analyzing trace with hash 959049721, now seen corresponding path program 1 times [2024-10-11 17:19:58,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:58,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311260983] [2024-10-11 17:19:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:58,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:58,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311260983] [2024-10-11 17:19:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311260983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:58,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369349419] [2024-10-11 17:19:58,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:58,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:58,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:58,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 376 [2024-10-11 17:19:58,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 279 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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-10-11 17:19:58,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:58,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 376 [2024-10-11 17:19:58,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:59,307 INFO L124 PetriNetUnfolderBase]: 1016/5592 cut-off events. [2024-10-11 17:19:59,307 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-10-11 17:19:59,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7331 conditions, 5592 events. 1016/5592 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 48749 event pairs, 681 based on Foata normal form. 0/4959 useless extension candidates. Maximal degree in co-relation 7270. Up to 1521 conditions per place. [2024-10-11 17:19:59,366 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 30 selfloop transitions, 3 changer transitions 0/285 dead transitions. [2024-10-11 17:19:59,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 285 transitions, 661 flow [2024-10-11 17:19:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1029 transitions. [2024-10-11 17:19:59,372 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9122340425531915 [2024-10-11 17:19:59,372 INFO L175 Difference]: Start difference. First operand has 280 places, 279 transitions, 583 flow. Second operand 3 states and 1029 transitions. [2024-10-11 17:19:59,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 285 transitions, 661 flow [2024-10-11 17:19:59,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 285 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:59,376 INFO L231 Difference]: Finished difference. Result has 280 places, 279 transitions, 598 flow [2024-10-11 17:19:59,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=280, PETRI_TRANSITIONS=279} [2024-10-11 17:19:59,377 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -17 predicate places. [2024-10-11 17:19:59,377 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 279 transitions, 598 flow [2024-10-11 17:19:59,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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-10-11 17:19:59,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:59,378 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] [2024-10-11 17:19:59,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:19:59,379 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-10-11 17:19:59,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:59,379 INFO L85 PathProgramCache]: Analyzing trace with hash -551292339, now seen corresponding path program 1 times [2024-10-11 17:19:59,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:59,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3454235] [2024-10-11 17:19:59,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:59,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:59,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:59,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3454235] [2024-10-11 17:19:59,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3454235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:59,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:59,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:59,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968069774] [2024-10-11 17:19:59,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:59,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:59,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:59,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:59,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:59,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 376 [2024-10-11 17:19:59,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 279 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-10-11 17:19:59,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:59,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 376 [2024-10-11 17:19:59,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:00,542 INFO L124 PetriNetUnfolderBase]: 1809/8597 cut-off events. [2024-10-11 17:20:00,543 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-11 17:20:00,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11676 conditions, 8597 events. 1809/8597 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 77830 event pairs, 655 based on Foata normal form. 0/7431 useless extension candidates. Maximal degree in co-relation 11614. Up to 1443 conditions per place. [2024-10-11 17:20:00,601 INFO L140 encePairwiseOnDemand]: 365/376 looper letters, 44 selfloop transitions, 8 changer transitions 0/303 dead transitions. [2024-10-11 17:20:00,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 303 transitions, 756 flow [2024-10-11 17:20:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1042 transitions. [2024-10-11 17:20:00,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9237588652482269 [2024-10-11 17:20:00,604 INFO L175 Difference]: Start difference. First operand has 280 places, 279 transitions, 598 flow. Second operand 3 states and 1042 transitions. [2024-10-11 17:20:00,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 303 transitions, 756 flow [2024-10-11 17:20:00,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 303 transitions, 756 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:00,613 INFO L231 Difference]: Finished difference. Result has 284 places, 287 transitions, 668 flow [2024-10-11 17:20:00,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=284, PETRI_TRANSITIONS=287} [2024-10-11 17:20:00,613 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -13 predicate places. [2024-10-11 17:20:00,613 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 287 transitions, 668 flow [2024-10-11 17:20:00,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-10-11 17:20:00,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:00,615 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] [2024-10-11 17:20:00,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:20:00,618 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-10-11 17:20:00,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash -883591864, now seen corresponding path program 1 times [2024-10-11 17:20:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:00,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562839522] [2024-10-11 17:20:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:00,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:00,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:00,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562839522] [2024-10-11 17:20:00,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562839522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:00,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:00,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:00,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359802238] [2024-10-11 17:20:00,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:00,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:00,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:00,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:00,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:00,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 376 [2024-10-11 17:20:00,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 287 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 329.6666666666667) internal successors, (989), 3 states have internal predecessors, (989), 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-10-11 17:20:00,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:00,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 376 [2024-10-11 17:20:00,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:01,975 INFO L124 PetriNetUnfolderBase]: 2111/10634 cut-off events. [2024-10-11 17:20:01,975 INFO L125 PetriNetUnfolderBase]: For 156/164 co-relation queries the response was YES. [2024-10-11 17:20:02,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14451 conditions, 10634 events. 2111/10634 cut-off events. For 156/164 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 102424 event pairs, 1244 based on Foata normal form. 0/9540 useless extension candidates. Maximal degree in co-relation 14387. Up to 2835 conditions per place. [2024-10-11 17:20:02,032 INFO L140 encePairwiseOnDemand]: 371/376 looper letters, 35 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2024-10-11 17:20:02,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 297 transitions, 765 flow [2024-10-11 17:20:02,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1024 transitions. [2024-10-11 17:20:02,036 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9078014184397163 [2024-10-11 17:20:02,036 INFO L175 Difference]: Start difference. First operand has 284 places, 287 transitions, 668 flow. Second operand 3 states and 1024 transitions. [2024-10-11 17:20:02,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 297 transitions, 765 flow [2024-10-11 17:20:02,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 297 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:02,043 INFO L231 Difference]: Finished difference. Result has 282 places, 286 transitions, 660 flow [2024-10-11 17:20:02,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=282, PETRI_TRANSITIONS=286} [2024-10-11 17:20:02,044 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -15 predicate places. [2024-10-11 17:20:02,044 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 286 transitions, 660 flow [2024-10-11 17:20:02,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.6666666666667) internal successors, (989), 3 states have internal predecessors, (989), 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-10-11 17:20:02,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:02,045 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] [2024-10-11 17:20:02,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:20:02,045 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-10-11 17:20:02,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:02,046 INFO L85 PathProgramCache]: Analyzing trace with hash 770097432, now seen corresponding path program 1 times [2024-10-11 17:20:02,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:02,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877428432] [2024-10-11 17:20:02,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:02,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:02,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:02,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877428432] [2024-10-11 17:20:02,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877428432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:02,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:02,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:02,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95870263] [2024-10-11 17:20:02,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:02,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:02,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:02,206 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 376 [2024-10-11 17:20:02,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 286 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-10-11 17:20:02,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:02,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 376 [2024-10-11 17:20:02,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:04,488 INFO L124 PetriNetUnfolderBase]: 4584/20435 cut-off events. [2024-10-11 17:20:04,488 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-10-11 17:20:04,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29161 conditions, 20435 events. 4584/20435 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 220965 event pairs, 2480 based on Foata normal form. 0/18516 useless extension candidates. Maximal degree in co-relation 29096. Up to 5342 conditions per place. [2024-10-11 17:20:04,612 INFO L140 encePairwiseOnDemand]: 366/376 looper letters, 45 selfloop transitions, 9 changer transitions 0/309 dead transitions. [2024-10-11 17:20:04,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 309 transitions, 820 flow [2024-10-11 17:20:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1042 transitions. [2024-10-11 17:20:04,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9237588652482269 [2024-10-11 17:20:04,616 INFO L175 Difference]: Start difference. First operand has 282 places, 286 transitions, 660 flow. Second operand 3 states and 1042 transitions. [2024-10-11 17:20:04,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 309 transitions, 820 flow [2024-10-11 17:20:04,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 309 transitions, 820 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:04,624 INFO L231 Difference]: Finished difference. Result has 286 places, 294 transitions, 730 flow [2024-10-11 17:20:04,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=286, PETRI_TRANSITIONS=294} [2024-10-11 17:20:04,627 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -11 predicate places. [2024-10-11 17:20:04,627 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 294 transitions, 730 flow [2024-10-11 17:20:04,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-10-11 17:20:04,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:04,628 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] [2024-10-11 17:20:04,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:20:04,628 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-10-11 17:20:04,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1103665336, now seen corresponding path program 1 times [2024-10-11 17:20:04,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:04,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067830921] [2024-10-11 17:20:04,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:05,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:05,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067830921] [2024-10-11 17:20:05,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067830921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:05,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:05,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:05,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986626060] [2024-10-11 17:20:05,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:05,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:20:05,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:05,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:20:05,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:20:05,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 376 [2024-10-11 17:20:05,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 294 transitions, 730 flow. Second operand has 5 states, 5 states have (on average 333.8) internal successors, (1669), 5 states have internal predecessors, (1669), 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-10-11 17:20:05,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:05,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 376 [2024-10-11 17:20:05,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:07,264 INFO L124 PetriNetUnfolderBase]: 2541/15373 cut-off events. [2024-10-11 17:20:07,264 INFO L125 PetriNetUnfolderBase]: For 522/586 co-relation queries the response was YES. [2024-10-11 17:20:07,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21711 conditions, 15373 events. 2541/15373 cut-off events. For 522/586 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 167377 event pairs, 1874 based on Foata normal form. 4/13953 useless extension candidates. Maximal degree in co-relation 21642. Up to 3397 conditions per place. [2024-10-11 17:20:07,380 INFO L140 encePairwiseOnDemand]: 367/376 looper letters, 36 selfloop transitions, 8 changer transitions 0/308 dead transitions. [2024-10-11 17:20:07,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 308 transitions, 845 flow [2024-10-11 17:20:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2037 transitions. [2024-10-11 17:20:07,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9029255319148937 [2024-10-11 17:20:07,390 INFO L175 Difference]: Start difference. First operand has 286 places, 294 transitions, 730 flow. Second operand 6 states and 2037 transitions. [2024-10-11 17:20:07,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 308 transitions, 845 flow [2024-10-11 17:20:07,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 308 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:07,405 INFO L231 Difference]: Finished difference. Result has 293 places, 298 transitions, 757 flow [2024-10-11 17:20:07,407 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=757, PETRI_PLACES=293, PETRI_TRANSITIONS=298} [2024-10-11 17:20:07,407 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -4 predicate places. [2024-10-11 17:20:07,407 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 298 transitions, 757 flow [2024-10-11 17:20:07,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 333.8) internal successors, (1669), 5 states have internal predecessors, (1669), 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-10-11 17:20:07,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:07,412 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] [2024-10-11 17:20:07,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:20:07,413 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-10-11 17:20:07,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:07,415 INFO L85 PathProgramCache]: Analyzing trace with hash 859261010, now seen corresponding path program 1 times [2024-10-11 17:20:07,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:07,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536111703] [2024-10-11 17:20:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:07,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:07,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536111703] [2024-10-11 17:20:07,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536111703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:07,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:07,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:07,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722660943] [2024-10-11 17:20:07,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:07,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:07,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:07,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:07,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:07,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 376 [2024-10-11 17:20:07,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 298 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 341.6666666666667) internal successors, (1025), 3 states have internal predecessors, (1025), 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-10-11 17:20:07,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:07,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 376 [2024-10-11 17:20:07,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:10,216 INFO L124 PetriNetUnfolderBase]: 3409/17659 cut-off events. [2024-10-11 17:20:10,217 INFO L125 PetriNetUnfolderBase]: For 225/256 co-relation queries the response was YES. [2024-10-11 17:20:10,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25221 conditions, 17659 events. 3409/17659 cut-off events. For 225/256 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 194537 event pairs, 1915 based on Foata normal form. 2/15744 useless extension candidates. Maximal degree in co-relation 25148. Up to 3412 conditions per place. [2024-10-11 17:20:10,345 INFO L140 encePairwiseOnDemand]: 372/376 looper letters, 29 selfloop transitions, 3 changer transitions 0/309 dead transitions. [2024-10-11 17:20:10,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 309 transitions, 846 flow [2024-10-11 17:20:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1053 transitions. [2024-10-11 17:20:10,348 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9335106382978723 [2024-10-11 17:20:10,348 INFO L175 Difference]: Start difference. First operand has 293 places, 298 transitions, 757 flow. Second operand 3 states and 1053 transitions. [2024-10-11 17:20:10,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 309 transitions, 846 flow [2024-10-11 17:20:10,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 309 transitions, 842 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:20:10,354 INFO L231 Difference]: Finished difference. Result has 296 places, 300 transitions, 775 flow [2024-10-11 17:20:10,355 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=296, PETRI_TRANSITIONS=300} [2024-10-11 17:20:10,355 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -1 predicate places. [2024-10-11 17:20:10,355 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 300 transitions, 775 flow [2024-10-11 17:20:10,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 341.6666666666667) internal successors, (1025), 3 states have internal predecessors, (1025), 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-10-11 17:20:10,356 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:10,356 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] [2024-10-11 17:20:10,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:20:10,356 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-10-11 17:20:10,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash -889790364, now seen corresponding path program 1 times [2024-10-11 17:20:10,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:10,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781481419] [2024-10-11 17:20:10,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:10,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:10,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:10,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781481419] [2024-10-11 17:20:10,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781481419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:10,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:10,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:10,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193818819] [2024-10-11 17:20:10,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:10,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:20:10,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:10,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:20:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:20:10,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 376 [2024-10-11 17:20:10,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 300 transitions, 775 flow. Second operand has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 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-10-11 17:20:10,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:10,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 376 [2024-10-11 17:20:10,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:13,504 INFO L124 PetriNetUnfolderBase]: 3863/20180 cut-off events. [2024-10-11 17:20:13,505 INFO L125 PetriNetUnfolderBase]: For 766/798 co-relation queries the response was YES. [2024-10-11 17:20:13,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29617 conditions, 20180 events. 3863/20180 cut-off events. For 766/798 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 226708 event pairs, 2596 based on Foata normal form. 6/18420 useless extension candidates. Maximal degree in co-relation 29541. Up to 5261 conditions per place. [2024-10-11 17:20:13,635 INFO L140 encePairwiseOnDemand]: 367/376 looper letters, 27 selfloop transitions, 4 changer transitions 17/312 dead transitions. [2024-10-11 17:20:13,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 312 transitions, 890 flow [2024-10-11 17:20:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2038 transitions. [2024-10-11 17:20:13,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9033687943262412 [2024-10-11 17:20:13,640 INFO L175 Difference]: Start difference. First operand has 296 places, 300 transitions, 775 flow. Second operand 6 states and 2038 transitions. [2024-10-11 17:20:13,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 312 transitions, 890 flow [2024-10-11 17:20:13,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 312 transitions, 884 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:13,651 INFO L231 Difference]: Finished difference. Result has 301 places, 295 transitions, 756 flow [2024-10-11 17:20:13,652 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=756, PETRI_PLACES=301, PETRI_TRANSITIONS=295} [2024-10-11 17:20:13,652 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, 4 predicate places. [2024-10-11 17:20:13,653 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 295 transitions, 756 flow [2024-10-11 17:20:13,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 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-10-11 17:20:13,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:13,654 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] [2024-10-11 17:20:13,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:20:13,654 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-10-11 17:20:13,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:13,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1995195063, now seen corresponding path program 1 times [2024-10-11 17:20:13,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:13,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177510277] [2024-10-11 17:20:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:13,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:20:14,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:14,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177510277] [2024-10-11 17:20:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177510277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:14,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:14,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362238315] [2024-10-11 17:20:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:14,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:14,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:14,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:14,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:14,323 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 376 [2024-10-11 17:20:14,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 295 transitions, 756 flow. Second operand has 6 states, 6 states have (on average 317.8333333333333) internal successors, (1907), 6 states have internal predecessors, (1907), 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-10-11 17:20:14,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:14,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 376 [2024-10-11 17:20:14,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:19,076 INFO L124 PetriNetUnfolderBase]: 9064/31848 cut-off events. [2024-10-11 17:20:19,077 INFO L125 PetriNetUnfolderBase]: For 2426/2544 co-relation queries the response was YES. [2024-10-11 17:20:19,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53143 conditions, 31848 events. 9064/31848 cut-off events. For 2426/2544 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 357984 event pairs, 3941 based on Foata normal form. 1/28915 useless extension candidates. Maximal degree in co-relation 53063. Up to 11134 conditions per place. [2024-10-11 17:20:19,368 INFO L140 encePairwiseOnDemand]: 362/376 looper letters, 95 selfloop transitions, 46 changer transitions 0/391 dead transitions. [2024-10-11 17:20:19,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 391 transitions, 1312 flow [2024-10-11 17:20:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2021 transitions. [2024-10-11 17:20:19,372 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8958333333333334 [2024-10-11 17:20:19,372 INFO L175 Difference]: Start difference. First operand has 301 places, 295 transitions, 756 flow. Second operand 6 states and 2021 transitions. [2024-10-11 17:20:19,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 391 transitions, 1312 flow [2024-10-11 17:20:19,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 391 transitions, 1284 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-10-11 17:20:19,392 INFO L231 Difference]: Finished difference. Result has 297 places, 340 transitions, 1063 flow [2024-10-11 17:20:19,394 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1063, PETRI_PLACES=297, PETRI_TRANSITIONS=340} [2024-10-11 17:20:19,395 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, 0 predicate places. [2024-10-11 17:20:19,395 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 340 transitions, 1063 flow [2024-10-11 17:20:19,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 317.8333333333333) internal successors, (1907), 6 states have internal predecessors, (1907), 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-10-11 17:20:19,396 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:19,396 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] [2024-10-11 17:20:19,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:20:19,397 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-10-11 17:20:19,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:19,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1956534939, now seen corresponding path program 1 times [2024-10-11 17:20:19,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:19,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727873793] [2024-10-11 17:20:19,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:20:19,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:19,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727873793] [2024-10-11 17:20:19,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727873793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:19,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:19,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:20:19,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954039817] [2024-10-11 17:20:19,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:19,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:20:19,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:19,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:20:19,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:20:20,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 376 [2024-10-11 17:20:20,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 340 transitions, 1063 flow. Second operand has 7 states, 7 states have (on average 327.0) internal successors, (2289), 7 states have internal predecessors, (2289), 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-10-11 17:20:20,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:20,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 376 [2024-10-11 17:20:20,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:25,961 INFO L124 PetriNetUnfolderBase]: 9626/40324 cut-off events. [2024-10-11 17:20:25,961 INFO L125 PetriNetUnfolderBase]: For 3853/5885 co-relation queries the response was YES. [2024-10-11 17:20:26,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66916 conditions, 40324 events. 9626/40324 cut-off events. For 3853/5885 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 496356 event pairs, 4687 based on Foata normal form. 254/36475 useless extension candidates. Maximal degree in co-relation 66842. Up to 10835 conditions per place. [2024-10-11 17:20:26,336 INFO L140 encePairwiseOnDemand]: 364/376 looper letters, 64 selfloop transitions, 14 changer transitions 10/389 dead transitions. [2024-10-11 17:20:26,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 389 transitions, 1342 flow [2024-10-11 17:20:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:20:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 17:20:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3338 transitions. [2024-10-11 17:20:26,347 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8877659574468085 [2024-10-11 17:20:26,348 INFO L175 Difference]: Start difference. First operand has 297 places, 340 transitions, 1063 flow. Second operand 10 states and 3338 transitions. [2024-10-11 17:20:26,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 389 transitions, 1342 flow [2024-10-11 17:20:26,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 389 transitions, 1342 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:26,368 INFO L231 Difference]: Finished difference. Result has 310 places, 347 transitions, 1130 flow [2024-10-11 17:20:26,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1130, PETRI_PLACES=310, PETRI_TRANSITIONS=347} [2024-10-11 17:20:26,368 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, 13 predicate places. [2024-10-11 17:20:26,369 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 347 transitions, 1130 flow [2024-10-11 17:20:26,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 327.0) internal successors, (2289), 7 states have internal predecessors, (2289), 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-10-11 17:20:26,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:26,370 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] [2024-10-11 17:20:26,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:20:26,370 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-10-11 17:20:26,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1382995944, now seen corresponding path program 1 times [2024-10-11 17:20:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:26,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454122281] [2024-10-11 17:20:26,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:20:26,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:26,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454122281] [2024-10-11 17:20:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454122281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:26,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:26,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:20:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532372891] [2024-10-11 17:20:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:26,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:20:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:20:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:20:27,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 376 [2024-10-11 17:20:27,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 347 transitions, 1130 flow. Second operand has 8 states, 8 states have (on average 321.875) internal successors, (2575), 8 states have internal predecessors, (2575), 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-10-11 17:20:27,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:27,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 376 [2024-10-11 17:20:27,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:34,587 INFO L124 PetriNetUnfolderBase]: 11330/45451 cut-off events. [2024-10-11 17:20:34,587 INFO L125 PetriNetUnfolderBase]: For 15697/17630 co-relation queries the response was YES. [2024-10-11 17:20:35,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85148 conditions, 45451 events. 11330/45451 cut-off events. For 15697/17630 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 560023 event pairs, 3999 based on Foata normal form. 114/41795 useless extension candidates. Maximal degree in co-relation 85068. Up to 8193 conditions per place. [2024-10-11 17:20:35,181 INFO L140 encePairwiseOnDemand]: 363/376 looper letters, 101 selfloop transitions, 44 changer transitions 0/417 dead transitions. [2024-10-11 17:20:35,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 417 transitions, 1712 flow [2024-10-11 17:20:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:20:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:20:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3616 transitions. [2024-10-11 17:20:35,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.874274661508704 [2024-10-11 17:20:35,186 INFO L175 Difference]: Start difference. First operand has 310 places, 347 transitions, 1130 flow. Second operand 11 states and 3616 transitions. [2024-10-11 17:20:35,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 417 transitions, 1712 flow [2024-10-11 17:20:35,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 417 transitions, 1704 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:20:35,221 INFO L231 Difference]: Finished difference. Result has 320 places, 368 transitions, 1447 flow [2024-10-11 17:20:35,222 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1447, PETRI_PLACES=320, PETRI_TRANSITIONS=368} [2024-10-11 17:20:35,222 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, 23 predicate places. [2024-10-11 17:20:35,222 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 368 transitions, 1447 flow [2024-10-11 17:20:35,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 321.875) internal successors, (2575), 8 states have internal predecessors, (2575), 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-10-11 17:20:35,223 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:35,224 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] [2024-10-11 17:20:35,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:20:35,224 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-10-11 17:20:35,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash -568247690, now seen corresponding path program 1 times [2024-10-11 17:20:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:35,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593292699] [2024-10-11 17:20:35,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:20:35,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:35,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593292699] [2024-10-11 17:20:35,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593292699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:35,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:35,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:35,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750856541] [2024-10-11 17:20:35,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:35,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:35,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:35,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:35,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:35,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 376 [2024-10-11 17:20:35,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 368 transitions, 1447 flow. Second operand has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 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-10-11 17:20:35,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:35,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 376 [2024-10-11 17:20:35,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:37,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][264], [30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 366#true, Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 352#L1066-11true, 481#true, 400#(= |#race~flags~0| 0), 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 355#L1040-7true]) [2024-10-11 17:20:37,183 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-11 17:20:37,183 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-11 17:20:37,183 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-11 17:20:37,183 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-11 17:20:37,238 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][264], [30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 352#L1066-11true, 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 355#L1040-7true]) [2024-10-11 17:20:37,238 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2024-10-11 17:20:37,238 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-11 17:20:37,238 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-11 17:20:37,238 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-11 17:20:37,238 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-11 17:20:37,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L1041-2-->L1041-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_52| v_~flags_mutex~0.base_10)) (.cse1 (+ v_~flags_mutex~0.offset_10 (* v_cleanerThread1of1ForFork0_~i~1_9 24)))) (and (= (select .cse0 .cse1) 0) (= |v_#pthreadsMutex_51| (store |v_#pthreadsMutex_52| v_~flags_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork0_#t~ret10_1| 0))) InVars {~flags_mutex~0.offset=v_~flags_mutex~0.offset_10, #pthreadsMutex=|v_#pthreadsMutex_52|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~flags_mutex~0.base=v_~flags_mutex~0.base_10} OutVars{~flags_mutex~0.offset=v_~flags_mutex~0.offset_10, #pthreadsMutex=|v_#pthreadsMutex_51|, cleanerThread1of1ForFork0_#t~ret10=|v_cleanerThread1of1ForFork0_#t~ret10_1|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~flags_mutex~0.base=v_~flags_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork0_#t~ret10][135], [Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 389#true, Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 393#true, Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 228#L1077true, 375#(= |#race~threads_total~0| 0), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 418#true, 387#(= |#race~flags_mutex~0| 0), 481#true, 295#L1035-5true, 400#(= |#race~flags~0| 0), 143#L1041-5true, 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 464#(not (= ~flags~0.base ~tids~0.base))]) [2024-10-11 17:20:37,420 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-10-11 17:20:37,420 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-10-11 17:20:37,420 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-10-11 17:20:37,420 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-10-11 17:20:37,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 96#L1066-8true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, 391#(= |#race~tids~0| 0), Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:37,424 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-10-11 17:20:37,425 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:37,425 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:37,425 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:37,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, Black: 385#true, 20#L1066-9true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 442#true, 368#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:37,441 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:37,441 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,441 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,442 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 96#L1066-8true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, 391#(= |#race~tids~0| 0), Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:37,442 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:37,442 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,442 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,442 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,444 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 389#true, Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 366#true, Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 96#L1066-8true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:37,444 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-10-11 17:20:37,444 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:37,444 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:37,444 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:37,444 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-10-11 17:20:37,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 366#true, Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, 391#(= |#race~tids~0| 0), Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 335#L1066-10true]) [2024-10-11 17:20:37,462 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:37,462 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,462 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,462 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, Black: 385#true, 20#L1066-9true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 442#true, 368#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:37,462 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:37,462 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,463 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,463 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,463 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, 20#L1066-9true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 389#true, Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 366#true, Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 481#true, 400#(= |#race~flags~0| 0), 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:37,463 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:37,463 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-11 17:20:37,463 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,463 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,463 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,464 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 389#true, Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 366#true, Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 96#L1066-8true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:37,464 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:37,464 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-11 17:20:37,465 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,465 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,465 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:37,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 366#true, Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, 391#(= |#race~tids~0| 0), Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 335#L1066-10true]) [2024-10-11 17:20:37,485 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2024-10-11 17:20:37,485 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:37,485 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:37,485 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:37,487 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 389#true, Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 366#true, Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 335#L1066-10true, Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:37,487 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:37,487 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-11 17:20:37,487 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,487 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,487 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,488 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, 20#L1066-9true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 389#true, Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 366#true, Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:37,488 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:37,488 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-11 17:20:37,488 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,488 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,488 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:37,510 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 389#true, Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 366#true, Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 481#true, 400#(= |#race~flags~0| 0), 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 335#L1066-10true, Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:37,511 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2024-10-11 17:20:37,511 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:37,511 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:37,511 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2024-10-11 17:20:37,511 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:41,402 INFO L124 PetriNetUnfolderBase]: 7652/35575 cut-off events. [2024-10-11 17:20:41,402 INFO L125 PetriNetUnfolderBase]: For 14147/15517 co-relation queries the response was YES. [2024-10-11 17:20:41,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65722 conditions, 35575 events. 7652/35575 cut-off events. For 14147/15517 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 443113 event pairs, 3346 based on Foata normal form. 133/32714 useless extension candidates. Maximal degree in co-relation 65640. Up to 7596 conditions per place. [2024-10-11 17:20:41,776 INFO L140 encePairwiseOnDemand]: 371/376 looper letters, 32 selfloop transitions, 5 changer transitions 0/381 dead transitions. [2024-10-11 17:20:41,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 381 transitions, 1549 flow [2024-10-11 17:20:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1051 transitions. [2024-10-11 17:20:41,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9317375886524822 [2024-10-11 17:20:41,778 INFO L175 Difference]: Start difference. First operand has 320 places, 368 transitions, 1447 flow. Second operand 3 states and 1051 transitions. [2024-10-11 17:20:41,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 381 transitions, 1549 flow [2024-10-11 17:20:41,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 381 transitions, 1538 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:20:41,848 INFO L231 Difference]: Finished difference. Result has 318 places, 371 transitions, 1472 flow [2024-10-11 17:20:41,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=318, PETRI_TRANSITIONS=371} [2024-10-11 17:20:41,848 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, 21 predicate places. [2024-10-11 17:20:41,849 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 371 transitions, 1472 flow [2024-10-11 17:20:41,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 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-10-11 17:20:41,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:41,849 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] [2024-10-11 17:20:41,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:20:41,850 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:20:41,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:41,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1383203682, now seen corresponding path program 1 times [2024-10-11 17:20:41,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:41,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245823861] [2024-10-11 17:20:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:20:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245823861] [2024-10-11 17:20:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245823861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:41,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:41,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916930070] [2024-10-11 17:20:41,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:41,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:41,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:41,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:41,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:41,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 376 [2024-10-11 17:20:41,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 371 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 333.6666666666667) internal successors, (1001), 3 states have internal predecessors, (1001), 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-10-11 17:20:41,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:41,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 376 [2024-10-11 17:20:41,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:44,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][263], [30#L1034-5true, 486#true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 366#true, Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 483#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 352#L1066-11true, 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, 391#(= |#race~tids~0| 0), Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 355#L1040-7true]) [2024-10-11 17:20:44,126 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-11 17:20:44,126 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-11 17:20:44,126 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-11 17:20:44,126 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-11 17:20:44,196 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][263], [486#true, 30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 483#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 352#L1066-11true, 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, 391#(= |#race~tids~0| 0), Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 355#L1040-7true]) [2024-10-11 17:20:44,196 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2024-10-11 17:20:44,196 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-11 17:20:44,197 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-11 17:20:44,197 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-11 17:20:44,197 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-11 17:20:44,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][289], [486#true, 30#L1034-5true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 204#L1042-5true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 483#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 352#L1066-11true, 481#true, 400#(= |#race~flags~0| 0), 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:44,368 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-10-11 17:20:44,368 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-10-11 17:20:44,368 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-10-11 17:20:44,368 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-10-11 17:20:44,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][290], [30#L1034-5true, 486#true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 389#true, Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 96#L1066-8true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 483#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 481#true, 400#(= |#race~flags~0| 0), 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 432#true, 391#(= |#race~tids~0| 0), Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:44,415 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-10-11 17:20:44,415 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:44,415 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:44,415 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:44,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][290], [30#L1034-5true, 486#true, Black: 385#true, 20#L1066-9true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 389#true, Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 483#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:44,435 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:44,435 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:44,435 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:44,436 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:44,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][290], [30#L1034-5true, 486#true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 389#true, Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 96#L1066-8true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 483#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 481#true, 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 400#(= |#race~flags~0| 0), 432#true, 391#(= |#race~tids~0| 0), Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:44,436 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:44,436 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:44,437 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:44,437 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:44,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][290], [30#L1034-5true, 486#true, Black: 385#true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 483#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 481#true, 400#(= |#race~flags~0| 0), 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 335#L1066-10true]) [2024-10-11 17:20:44,459 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:44,459 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:44,459 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:44,459 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:44,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][290], [30#L1034-5true, 486#true, Black: 385#true, 20#L1066-9true, Black: 447#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 389#true, Black: 448#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 454#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 366#true, Black: 446#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 395#(= |#race~threads_alive~0| 0), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 464#(not (= ~flags~0.base ~tids~0.base)), Black: 465#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 476#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 368#true, 442#true, Black: 483#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 420#(= |#race~data~0| 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 481#true, 400#(= |#race~flags~0| 0), 474#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 432#true, Black: 435#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 391#(= |#race~tids~0| 0), Black: 437#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 436#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 434#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|)]) [2024-10-11 17:20:44,460 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:44,460 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:44,460 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:44,460 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event