./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-ext/48_ticket_lock_low_contention_vs-pthread.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-ext/48_ticket_lock_low_contention_vs-pthread.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 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:51:59,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:51:59,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 16:51:59,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:51:59,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:51:59,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:51:59,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:51:59,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:51:59,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:51:59,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:51:59,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:51:59,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:51:59,308 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:51:59,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:51:59,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:51:59,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:51:59,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:51:59,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:51:59,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:51:59,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:51:59,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:51:59,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:51:59,317 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 16:51:59,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:51:59,318 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 16:51:59,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:51:59,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:51:59,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:51:59,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:51:59,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:51:59,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:51:59,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:51:59,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:51:59,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:51:59,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:51:59,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:51:59,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:51:59,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:51:59,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:51:59,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:51:59,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:51:59,324 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 -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 [2024-10-11 16:51:59,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:51:59,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:51:59,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:51:59,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:51:59,633 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:51:59,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-10-11 16:52:01,195 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:52:01,428 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:52:01,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-10-11 16:52:01,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/276d5b5c1/079b55796c7349039a27f98deee73618/FLAG19c32e56c [2024-10-11 16:52:01,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/276d5b5c1/079b55796c7349039a27f98deee73618 [2024-10-11 16:52:01,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:52:01,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:52:01,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:52:01,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:52:01,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:52:01,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:52:01" (1/1) ... [2024-10-11 16:52:01,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18081bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:01, skipping insertion in model container [2024-10-11 16:52:01,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:52:01" (1/1) ... [2024-10-11 16:52:01,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:52:01,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:52:01,894 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:52:01,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:52:02,032 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:52:02,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02 WrapperNode [2024-10-11 16:52:02,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:52:02,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:52:02,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:52:02,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:52:02,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (1/1) ... [2024-10-11 16:52:02,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (1/1) ... [2024-10-11 16:52:02,114 INFO L138 Inliner]: procedures = 164, calls = 17, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 87 [2024-10-11 16:52:02,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:52:02,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:52:02,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:52:02,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:52:02,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (1/1) ... [2024-10-11 16:52:02,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (1/1) ... [2024-10-11 16:52:02,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (1/1) ... [2024-10-11 16:52:02,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (1/1) ... [2024-10-11 16:52:02,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (1/1) ... [2024-10-11 16:52:02,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (1/1) ... [2024-10-11 16:52:02,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (1/1) ... [2024-10-11 16:52:02,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (1/1) ... [2024-10-11 16:52:02,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:52:02,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:52:02,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:52:02,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:52:02,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (1/1) ... [2024-10-11 16:52:02,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:52:02,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:52:02,193 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 16:52:02,197 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 16:52:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-11 16:52:02,251 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-11 16:52:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 16:52:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:52:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 16:52:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 16:52:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:52:02,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:52:02,254 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 16:52:02,418 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:52:02,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:52:02,648 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 16:52:02,648 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:52:02,686 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:52:02,687 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 16:52:02,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:52:02 BoogieIcfgContainer [2024-10-11 16:52:02,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:52:02,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:52:02,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:52:02,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:52:02,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:52:01" (1/3) ... [2024-10-11 16:52:02,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62667579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:52:02, skipping insertion in model container [2024-10-11 16:52:02,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:52:02" (2/3) ... [2024-10-11 16:52:02,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62667579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:52:02, skipping insertion in model container [2024-10-11 16:52:02,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:52:02" (3/3) ... [2024-10-11 16:52:02,699 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2024-10-11 16:52:02,720 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:52:02,721 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 16:52:02,721 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 16:52:02,783 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 16:52:02,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 99 transitions, 202 flow [2024-10-11 16:52:02,896 INFO L124 PetriNetUnfolderBase]: 8/149 cut-off events. [2024-10-11 16:52:02,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 16:52:02,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 149 events. 8/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 352 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2024-10-11 16:52:02,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 99 transitions, 202 flow [2024-10-11 16:52:02,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 202 flow [2024-10-11 16:52:02,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:52:02,933 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;@1becb1f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:52:02,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 16:52:02,950 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 16:52:02,952 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2024-10-11 16:52:02,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 16:52:02,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:02,953 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] [2024-10-11 16:52:02,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 16:52:02,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1583107030, now seen corresponding path program 1 times [2024-10-11 16:52:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:02,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879032030] [2024-10-11 16:52:02,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:02,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:03,202 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 16:52:03,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:03,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879032030] [2024-10-11 16:52:03,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879032030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:03,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:03,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32963431] [2024-10-11 16:52:03,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:03,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:52:03,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:03,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:52:03,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:52:03,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2024-10-11 16:52:03,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 202 flow. Second operand has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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 16:52:03,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:03,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2024-10-11 16:52:03,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:03,316 INFO L124 PetriNetUnfolderBase]: 4/189 cut-off events. [2024-10-11 16:52:03,317 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 16:52:03,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 189 events. 4/189 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 542 event pairs, 4 based on Foata normal form. 16/181 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2024-10-11 16:52:03,320 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 5 selfloop transitions, 0 changer transitions 0/90 dead transitions. [2024-10-11 16:52:03,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 194 flow [2024-10-11 16:52:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:52:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 16:52:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2024-10-11 16:52:03,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2024-10-11 16:52:03,337 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 202 flow. Second operand 2 states and 184 transitions. [2024-10-11 16:52:03,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 194 flow [2024-10-11 16:52:03,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 16:52:03,344 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 184 flow [2024-10-11 16:52:03,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=184, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2024-10-11 16:52:03,351 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2024-10-11 16:52:03,351 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 184 flow [2024-10-11 16:52:03,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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 16:52:03,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:03,352 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] [2024-10-11 16:52:03,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:52:03,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 16:52:03,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:03,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1546415920, now seen corresponding path program 1 times [2024-10-11 16:52:03,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:03,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270512435] [2024-10-11 16:52:03,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:03,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:03,467 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 16:52:03,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:03,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270512435] [2024-10-11 16:52:03,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270512435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:03,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:03,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:03,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139519693] [2024-10-11 16:52:03,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:03,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:03,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:03,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:03,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:03,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 99 [2024-10-11 16:52:03,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 16:52:03,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:03,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 99 [2024-10-11 16:52:03,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:03,648 INFO L124 PetriNetUnfolderBase]: 59/448 cut-off events. [2024-10-11 16:52:03,649 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 16:52:03,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 448 events. 59/448 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2365 event pairs, 41 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 597. Up to 126 conditions per place. [2024-10-11 16:52:03,653 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2024-10-11 16:52:03,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 246 flow [2024-10-11 16:52:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2024-10-11 16:52:03,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8417508417508418 [2024-10-11 16:52:03,656 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 184 flow. Second operand 3 states and 250 transitions. [2024-10-11 16:52:03,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 246 flow [2024-10-11 16:52:03,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 16:52:03,663 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 230 flow [2024-10-11 16:52:03,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2024-10-11 16:52:03,665 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2024-10-11 16:52:03,665 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 230 flow [2024-10-11 16:52:03,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 16:52:03,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:03,666 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] [2024-10-11 16:52:03,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:52:03,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 16:52:03,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2130394336, now seen corresponding path program 1 times [2024-10-11 16:52:03,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:03,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767861886] [2024-10-11 16:52:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:03,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:03,817 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 16:52:03,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:03,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767861886] [2024-10-11 16:52:03,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767861886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:03,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:03,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091323691] [2024-10-11 16:52:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:03,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:03,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:03,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:03,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 99 [2024-10-11 16:52:03,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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 16:52:03,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:03,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 99 [2024-10-11 16:52:03,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:03,979 INFO L124 PetriNetUnfolderBase]: 64/427 cut-off events. [2024-10-11 16:52:03,979 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2024-10-11 16:52:03,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 427 events. 64/427 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2341 event pairs, 32 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 667. Up to 119 conditions per place. [2024-10-11 16:52:03,987 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2024-10-11 16:52:03,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 102 transitions, 298 flow [2024-10-11 16:52:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2024-10-11 16:52:03,994 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8552188552188552 [2024-10-11 16:52:03,995 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 230 flow. Second operand 3 states and 254 transitions. [2024-10-11 16:52:03,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 102 transitions, 298 flow [2024-10-11 16:52:03,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 102 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:52:04,001 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 270 flow [2024-10-11 16:52:04,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=100, PETRI_TRANSITIONS=100} [2024-10-11 16:52:04,003 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places. [2024-10-11 16:52:04,003 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 270 flow [2024-10-11 16:52:04,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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 16:52:04,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:04,004 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:52:04,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:52:04,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 16:52:04,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2129827008, now seen corresponding path program 1 times [2024-10-11 16:52:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:04,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592979658] [2024-10-11 16:52:04,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:04,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:52:04,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 16:52:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:52:04,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 16:52:04,085 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 16:52:04,086 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-10-11 16:52:04,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-10-11 16:52:04,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-10-11 16:52:04,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-10-11 16:52:04,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-10-11 16:52:04,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-10-11 16:52:04,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-10-11 16:52:04,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-10-11 16:52:04,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-10-11 16:52:04,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-10-11 16:52:04,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:52:04,091 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 16:52:04,094 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 16:52:04,094 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 16:52:04,126 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 16:52:04,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 130 transitions, 270 flow [2024-10-11 16:52:04,159 INFO L124 PetriNetUnfolderBase]: 13/230 cut-off events. [2024-10-11 16:52:04,160 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 16:52:04,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 230 events. 13/230 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 766 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 150. Up to 6 conditions per place. [2024-10-11 16:52:04,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 130 transitions, 270 flow [2024-10-11 16:52:04,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 130 transitions, 270 flow [2024-10-11 16:52:04,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:52:04,173 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;@1becb1f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:52:04,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-11 16:52:04,178 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 16:52:04,180 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2024-10-11 16:52:04,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 16:52:04,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:04,181 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] [2024-10-11 16:52:04,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 16:52:04,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:04,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1723236182, now seen corresponding path program 1 times [2024-10-11 16:52:04,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:04,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251643038] [2024-10-11 16:52:04,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:04,217 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 16:52:04,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:04,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251643038] [2024-10-11 16:52:04,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251643038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:04,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:04,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:04,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384095415] [2024-10-11 16:52:04,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:04,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:52:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:52:04,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:52:04,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130 [2024-10-11 16:52:04,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 270 flow. Second operand has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 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 16:52:04,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:04,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130 [2024-10-11 16:52:04,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:04,314 INFO L124 PetriNetUnfolderBase]: 34/566 cut-off events. [2024-10-11 16:52:04,314 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-11 16:52:04,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 566 events. 34/566 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3265 event pairs, 34 based on Foata normal form. 67/546 useless extension candidates. Maximal degree in co-relation 429. Up to 73 conditions per place. [2024-10-11 16:52:04,320 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 8 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2024-10-11 16:52:04,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 260 flow [2024-10-11 16:52:04,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:52:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 16:52:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2024-10-11 16:52:04,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9192307692307692 [2024-10-11 16:52:04,323 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 270 flow. Second operand 2 states and 239 transitions. [2024-10-11 16:52:04,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 260 flow [2024-10-11 16:52:04,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 16:52:04,328 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 244 flow [2024-10-11 16:52:04,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=244, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2024-10-11 16:52:04,331 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2024-10-11 16:52:04,332 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 244 flow [2024-10-11 16:52:04,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 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 16:52:04,332 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:04,332 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] [2024-10-11 16:52:04,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:52:04,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 16:52:04,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:04,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1666931310, now seen corresponding path program 1 times [2024-10-11 16:52:04,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:04,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310175117] [2024-10-11 16:52:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:04,385 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 16:52:04,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:04,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310175117] [2024-10-11 16:52:04,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310175117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:04,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:04,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66242222] [2024-10-11 16:52:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:04,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:04,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:04,488 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-10-11 16:52:04,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 16:52:04,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:04,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-10-11 16:52:04,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:04,944 INFO L124 PetriNetUnfolderBase]: 845/3283 cut-off events. [2024-10-11 16:52:04,944 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 16:52:04,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4733 conditions, 3283 events. 845/3283 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 29834 event pairs, 632 based on Foata normal form. 0/2783 useless extension candidates. Maximal degree in co-relation 4728. Up to 1252 conditions per place. [2024-10-11 16:52:04,967 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 26 selfloop transitions, 9 changer transitions 0/129 dead transitions. [2024-10-11 16:52:04,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 338 flow [2024-10-11 16:52:04,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2024-10-11 16:52:04,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2024-10-11 16:52:04,969 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 244 flow. Second operand 3 states and 327 transitions. [2024-10-11 16:52:04,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 338 flow [2024-10-11 16:52:04,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 129 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 16:52:04,973 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 314 flow [2024-10-11 16:52:04,974 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=127, PETRI_TRANSITIONS=125} [2024-10-11 16:52:04,976 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places. [2024-10-11 16:52:04,976 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 314 flow [2024-10-11 16:52:04,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 16:52:04,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:04,977 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] [2024-10-11 16:52:04,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:52:04,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 16:52:04,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:04,977 INFO L85 PathProgramCache]: Analyzing trace with hash 916108832, now seen corresponding path program 1 times [2024-10-11 16:52:04,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:04,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108610945] [2024-10-11 16:52:04,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:04,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:05,041 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 16:52:05,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:05,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108610945] [2024-10-11 16:52:05,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108610945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:05,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:05,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926779979] [2024-10-11 16:52:05,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:05,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:05,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:05,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:05,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:05,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-10-11 16:52:05,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 16:52:05,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:05,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-10-11 16:52:05,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:05,510 INFO L124 PetriNetUnfolderBase]: 1088/3830 cut-off events. [2024-10-11 16:52:05,511 INFO L125 PetriNetUnfolderBase]: For 861/1014 co-relation queries the response was YES. [2024-10-11 16:52:05,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6732 conditions, 3830 events. 1088/3830 cut-off events. For 861/1014 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 36040 event pairs, 560 based on Foata normal form. 3/3223 useless extension candidates. Maximal degree in co-relation 6725. Up to 1421 conditions per place. [2024-10-11 16:52:05,545 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 30 selfloop transitions, 13 changer transitions 0/141 dead transitions. [2024-10-11 16:52:05,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 141 transitions, 459 flow [2024-10-11 16:52:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-10-11 16:52:05,547 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-10-11 16:52:05,547 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 314 flow. Second operand 3 states and 332 transitions. [2024-10-11 16:52:05,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 141 transitions, 459 flow [2024-10-11 16:52:05,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 141 transitions, 433 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:52:05,558 INFO L231 Difference]: Finished difference. Result has 129 places, 136 transitions, 408 flow [2024-10-11 16:52:05,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=129, PETRI_TRANSITIONS=136} [2024-10-11 16:52:05,560 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2024-10-11 16:52:05,560 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 136 transitions, 408 flow [2024-10-11 16:52:05,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 16:52:05,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:05,561 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] [2024-10-11 16:52:05,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:52:05,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 16:52:05,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:05,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1138438696, now seen corresponding path program 1 times [2024-10-11 16:52:05,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:05,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745724564] [2024-10-11 16:52:05,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:05,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:05,610 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 16:52:05,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:05,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745724564] [2024-10-11 16:52:05,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745724564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:05,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:05,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085491439] [2024-10-11 16:52:05,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:05,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:05,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:05,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:05,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-10-11 16:52:05,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 136 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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 16:52:05,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:05,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-10-11 16:52:05,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:06,404 INFO L124 PetriNetUnfolderBase]: 2061/6890 cut-off events. [2024-10-11 16:52:06,406 INFO L125 PetriNetUnfolderBase]: For 3809/3989 co-relation queries the response was YES. [2024-10-11 16:52:06,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13659 conditions, 6890 events. 2061/6890 cut-off events. For 3809/3989 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 72127 event pairs, 630 based on Foata normal form. 7/5761 useless extension candidates. Maximal degree in co-relation 13651. Up to 1788 conditions per place. [2024-10-11 16:52:06,485 INFO L140 encePairwiseOnDemand]: 115/130 looper letters, 44 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2024-10-11 16:52:06,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 168 transitions, 707 flow [2024-10-11 16:52:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2024-10-11 16:52:06,487 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8615384615384616 [2024-10-11 16:52:06,487 INFO L175 Difference]: Start difference. First operand has 129 places, 136 transitions, 408 flow. Second operand 3 states and 336 transitions. [2024-10-11 16:52:06,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 168 transitions, 707 flow [2024-10-11 16:52:06,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 168 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:52:06,502 INFO L231 Difference]: Finished difference. Result has 131 places, 161 transitions, 664 flow [2024-10-11 16:52:06,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=131, PETRI_TRANSITIONS=161} [2024-10-11 16:52:06,505 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2024-10-11 16:52:06,505 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 161 transitions, 664 flow [2024-10-11 16:52:06,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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 16:52:06,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:06,506 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] [2024-10-11 16:52:06,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 16:52:06,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 16:52:06,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:06,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1868486520, now seen corresponding path program 1 times [2024-10-11 16:52:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:06,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305581610] [2024-10-11 16:52:06,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:06,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:06,554 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 16:52:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305581610] [2024-10-11 16:52:06,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305581610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:06,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:06,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:06,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34529653] [2024-10-11 16:52:06,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:06,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:06,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:06,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:06,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:06,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-10-11 16:52:06,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 161 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 16:52:06,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:06,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-10-11 16:52:06,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:07,712 INFO L124 PetriNetUnfolderBase]: 2966/9755 cut-off events. [2024-10-11 16:52:07,713 INFO L125 PetriNetUnfolderBase]: For 15047/15536 co-relation queries the response was YES. [2024-10-11 16:52:07,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23389 conditions, 9755 events. 2966/9755 cut-off events. For 15047/15536 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 106016 event pairs, 1072 based on Foata normal form. 41/8329 useless extension candidates. Maximal degree in co-relation 23380. Up to 3627 conditions per place. [2024-10-11 16:52:07,790 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 60 selfloop transitions, 22 changer transitions 0/183 dead transitions. [2024-10-11 16:52:07,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 183 transitions, 976 flow [2024-10-11 16:52:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2024-10-11 16:52:07,791 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2024-10-11 16:52:07,792 INFO L175 Difference]: Start difference. First operand has 131 places, 161 transitions, 664 flow. Second operand 3 states and 327 transitions. [2024-10-11 16:52:07,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 183 transitions, 976 flow [2024-10-11 16:52:07,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 183 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:52:07,805 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 862 flow [2024-10-11 16:52:07,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2024-10-11 16:52:07,806 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2024-10-11 16:52:07,806 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 862 flow [2024-10-11 16:52:07,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 16:52:07,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:07,807 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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] [2024-10-11 16:52:07,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:52:07,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 16:52:07,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1763227351, now seen corresponding path program 1 times [2024-10-11 16:52:07,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:07,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905583594] [2024-10-11 16:52:07,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:07,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 16:52:07,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:07,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905583594] [2024-10-11 16:52:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905583594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:07,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:07,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:07,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937257341] [2024-10-11 16:52:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:07,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:07,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:07,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-10-11 16:52:07,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 179 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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 16:52:07,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:07,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-10-11 16:52:07,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:09,073 INFO L124 PetriNetUnfolderBase]: 3533/10646 cut-off events. [2024-10-11 16:52:09,073 INFO L125 PetriNetUnfolderBase]: For 19402/19852 co-relation queries the response was YES. [2024-10-11 16:52:09,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27773 conditions, 10646 events. 3533/10646 cut-off events. For 19402/19852 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 115646 event pairs, 994 based on Foata normal form. 26/8880 useless extension candidates. Maximal degree in co-relation 27763. Up to 3995 conditions per place. [2024-10-11 16:52:09,183 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 68 selfloop transitions, 36 changer transitions 0/209 dead transitions. [2024-10-11 16:52:09,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 209 transitions, 1284 flow [2024-10-11 16:52:09,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2024-10-11 16:52:09,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8487179487179487 [2024-10-11 16:52:09,188 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 862 flow. Second operand 3 states and 331 transitions. [2024-10-11 16:52:09,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 209 transitions, 1284 flow [2024-10-11 16:52:09,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 209 transitions, 1184 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-10-11 16:52:09,230 INFO L231 Difference]: Finished difference. Result has 135 places, 205 transitions, 1166 flow [2024-10-11 16:52:09,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=135, PETRI_TRANSITIONS=205} [2024-10-11 16:52:09,231 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2024-10-11 16:52:09,231 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 205 transitions, 1166 flow [2024-10-11 16:52:09,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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 16:52:09,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:09,232 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] [2024-10-11 16:52:09,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:52:09,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 16:52:09,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash -453541239, now seen corresponding path program 1 times [2024-10-11 16:52:09,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:09,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906837484] [2024-10-11 16:52:09,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:09,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:09,274 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 16:52:09,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906837484] [2024-10-11 16:52:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906837484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:09,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:09,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:09,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937289613] [2024-10-11 16:52:09,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:09,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:09,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:09,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:09,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:09,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-10-11 16:52:09,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 205 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 16:52:09,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:09,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-10-11 16:52:09,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:10,708 INFO L124 PetriNetUnfolderBase]: 4494/13130 cut-off events. [2024-10-11 16:52:10,708 INFO L125 PetriNetUnfolderBase]: For 33502/34099 co-relation queries the response was YES. [2024-10-11 16:52:10,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37401 conditions, 13130 events. 4494/13130 cut-off events. For 33502/34099 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 144792 event pairs, 1133 based on Foata normal form. 23/11003 useless extension candidates. Maximal degree in co-relation 37390. Up to 4861 conditions per place. [2024-10-11 16:52:10,830 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 91 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2024-10-11 16:52:10,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 236 transitions, 1685 flow [2024-10-11 16:52:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-10-11 16:52:10,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-10-11 16:52:10,832 INFO L175 Difference]: Start difference. First operand has 135 places, 205 transitions, 1166 flow. Second operand 3 states and 332 transitions. [2024-10-11 16:52:10,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 236 transitions, 1685 flow [2024-10-11 16:52:10,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 236 transitions, 1597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:52:10,857 INFO L231 Difference]: Finished difference. Result has 137 places, 231 transitions, 1530 flow [2024-10-11 16:52:10,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1530, PETRI_PLACES=137, PETRI_TRANSITIONS=231} [2024-10-11 16:52:10,859 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2024-10-11 16:52:10,859 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 231 transitions, 1530 flow [2024-10-11 16:52:10,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 16:52:10,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:10,859 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:52:10,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:52:10,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 16:52:10,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:10,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1721952119, now seen corresponding path program 1 times [2024-10-11 16:52:10,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:10,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350131896] [2024-10-11 16:52:10,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:10,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:52:10,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 16:52:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:52:10,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 16:52:10,884 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 16:52:10,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-10-11 16:52:10,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-10-11 16:52:10,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-10-11 16:52:10,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-10-11 16:52:10,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-10-11 16:52:10,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-10-11 16:52:10,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-10-11 16:52:10,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-10-11 16:52:10,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-10-11 16:52:10,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-10-11 16:52:10,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-10-11 16:52:10,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-10-11 16:52:10,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-10-11 16:52:10,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 16:52:10,886 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:52:10,886 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 16:52:10,886 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 16:52:10,923 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 16:52:10,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 161 transitions, 340 flow [2024-10-11 16:52:10,953 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2024-10-11 16:52:10,954 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 16:52:10,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 311 events. 18/311 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1199 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 234. Up to 8 conditions per place. [2024-10-11 16:52:10,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 161 transitions, 340 flow [2024-10-11 16:52:10,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 161 transitions, 340 flow [2024-10-11 16:52:10,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:52:10,961 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;@1becb1f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:52:10,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 16:52:10,965 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 16:52:10,965 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2024-10-11 16:52:10,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 16:52:10,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:10,965 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] [2024-10-11 16:52:10,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 16:52:10,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:10,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1142734570, now seen corresponding path program 1 times [2024-10-11 16:52:10,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:10,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566645556] [2024-10-11 16:52:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:10,985 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 16:52:10,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:10,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566645556] [2024-10-11 16:52:10,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566645556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:10,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:10,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:10,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666558865] [2024-10-11 16:52:10,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:10,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:52:10,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:10,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:52:10,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:52:10,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2024-10-11 16:52:10,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 161 transitions, 340 flow. Second operand has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 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 16:52:10,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:10,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2024-10-11 16:52:10,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:11,166 INFO L124 PetriNetUnfolderBase]: 178/1732 cut-off events. [2024-10-11 16:52:11,166 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-10-11 16:52:11,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 1732 events. 178/1732 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 14445 event pairs, 178 based on Foata normal form. 260/1709 useless extension candidates. Maximal degree in co-relation 1375. Up to 298 conditions per place. [2024-10-11 16:52:11,185 INFO L140 encePairwiseOnDemand]: 152/161 looper letters, 11 selfloop transitions, 0 changer transitions 0/144 dead transitions. [2024-10-11 16:52:11,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 328 flow [2024-10-11 16:52:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:52:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 16:52:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2024-10-11 16:52:11,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2024-10-11 16:52:11,186 INFO L175 Difference]: Start difference. First operand has 159 places, 161 transitions, 340 flow. Second operand 2 states and 294 transitions. [2024-10-11 16:52:11,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 328 flow [2024-10-11 16:52:11,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 144 transitions, 326 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-11 16:52:11,189 INFO L231 Difference]: Finished difference. Result has 152 places, 144 transitions, 304 flow [2024-10-11 16:52:11,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=304, PETRI_PLACES=152, PETRI_TRANSITIONS=144} [2024-10-11 16:52:11,190 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -7 predicate places. [2024-10-11 16:52:11,190 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 304 flow [2024-10-11 16:52:11,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 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 16:52:11,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:11,191 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] [2024-10-11 16:52:11,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 16:52:11,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 16:52:11,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2146567085, now seen corresponding path program 1 times [2024-10-11 16:52:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:11,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267492278] [2024-10-11 16:52:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:11,325 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 16:52:11,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:11,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267492278] [2024-10-11 16:52:11,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267492278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:11,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:11,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:11,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102225402] [2024-10-11 16:52:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:11,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:11,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:11,392 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2024-10-11 16:52:11,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 144 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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 16:52:11,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:11,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2024-10-11 16:52:11,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:13,422 INFO L124 PetriNetUnfolderBase]: 8153/23044 cut-off events. [2024-10-11 16:52:13,422 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-10-11 16:52:13,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34911 conditions, 23044 events. 8153/23044 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 266221 event pairs, 6332 based on Foata normal form. 0/19799 useless extension candidates. Maximal degree in co-relation 34905. Up to 10488 conditions per place. [2024-10-11 16:52:13,594 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 34 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2024-10-11 16:52:13,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 161 transitions, 430 flow [2024-10-11 16:52:13,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2024-10-11 16:52:13,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2024-10-11 16:52:13,596 INFO L175 Difference]: Start difference. First operand has 152 places, 144 transitions, 304 flow. Second operand 3 states and 404 transitions. [2024-10-11 16:52:13,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 161 transitions, 430 flow [2024-10-11 16:52:13,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 161 transitions, 430 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 16:52:13,599 INFO L231 Difference]: Finished difference. Result has 156 places, 155 transitions, 398 flow [2024-10-11 16:52:13,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=156, PETRI_TRANSITIONS=155} [2024-10-11 16:52:13,600 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -3 predicate places. [2024-10-11 16:52:13,601 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 155 transitions, 398 flow [2024-10-11 16:52:13,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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 16:52:13,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:13,601 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] [2024-10-11 16:52:13,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 16:52:13,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 16:52:13,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:13,602 INFO L85 PathProgramCache]: Analyzing trace with hash -322995646, now seen corresponding path program 1 times [2024-10-11 16:52:13,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:13,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525222022] [2024-10-11 16:52:13,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:13,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:13,630 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 16:52:13,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525222022] [2024-10-11 16:52:13,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525222022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:13,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:13,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:13,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492441735] [2024-10-11 16:52:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:13,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:13,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:13,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:13,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:13,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2024-10-11 16:52:13,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 155 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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 16:52:13,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:13,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2024-10-11 16:52:13,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:16,245 INFO L124 PetriNetUnfolderBase]: 11247/29861 cut-off events. [2024-10-11 16:52:16,245 INFO L125 PetriNetUnfolderBase]: For 7866/9081 co-relation queries the response was YES. [2024-10-11 16:52:16,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56111 conditions, 29861 events. 11247/29861 cut-off events. For 7866/9081 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 351640 event pairs, 6419 based on Foata normal form. 28/25419 useless extension candidates. Maximal degree in co-relation 56103. Up to 13140 conditions per place. [2024-10-11 16:52:16,695 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 42 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2024-10-11 16:52:16,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 180 transitions, 620 flow [2024-10-11 16:52:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2024-10-11 16:52:16,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8488612836438924 [2024-10-11 16:52:16,697 INFO L175 Difference]: Start difference. First operand has 156 places, 155 transitions, 398 flow. Second operand 3 states and 410 transitions. [2024-10-11 16:52:16,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 180 transitions, 620 flow [2024-10-11 16:52:16,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 180 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:52:16,776 INFO L231 Difference]: Finished difference. Result has 158 places, 172 transitions, 546 flow [2024-10-11 16:52:16,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=158, PETRI_TRANSITIONS=172} [2024-10-11 16:52:16,778 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -1 predicate places. [2024-10-11 16:52:16,778 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 172 transitions, 546 flow [2024-10-11 16:52:16,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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 16:52:16,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:16,779 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] [2024-10-11 16:52:16,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 16:52:16,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 16:52:16,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash -611458056, now seen corresponding path program 1 times [2024-10-11 16:52:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:16,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445940533] [2024-10-11 16:52:16,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:16,809 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 16:52:16,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:16,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445940533] [2024-10-11 16:52:16,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445940533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:16,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:16,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094118260] [2024-10-11 16:52:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:16,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:16,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:16,868 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 161 [2024-10-11 16:52:16,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 172 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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 16:52:16,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:16,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 161 [2024-10-11 16:52:16,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:20,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][148], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 70#L693-7true, 169#true, 108#L693-7true, 176#(= |#race~c~0| 0), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true]) [2024-10-11 16:52:20,716 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-11 16:52:20,716 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:20,716 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:20,716 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:20,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][214], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 160#true, 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 54#L693-14true, 158#true]) [2024-10-11 16:52:20,967 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:20,967 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:20,967 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:20,967 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:20,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][196], [106#L693-4true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2024-10-11 16:52:20,976 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:20,976 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:20,976 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:20,976 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:21,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][125], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2024-10-11 16:52:21,575 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:21,575 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:21,575 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:21,575 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:21,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][174], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 160#true, 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 174#true, 158#true]) [2024-10-11 16:52:21,577 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:21,577 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:21,577 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:21,577 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:23,879 INFO L124 PetriNetUnfolderBase]: 31822/78787 cut-off events. [2024-10-11 16:52:23,879 INFO L125 PetriNetUnfolderBase]: For 55391/57079 co-relation queries the response was YES. [2024-10-11 16:52:24,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171117 conditions, 78787 events. 31822/78787 cut-off events. For 55391/57079 co-relation queries the response was YES. Maximal size of possible extension queue 2883. Compared 1033087 event pairs, 10576 based on Foata normal form. 71/64972 useless extension candidates. Maximal degree in co-relation 171108. Up to 24692 conditions per place. [2024-10-11 16:52:24,741 INFO L140 encePairwiseOnDemand]: 141/161 looper letters, 65 selfloop transitions, 40 changer transitions 0/222 dead transitions. [2024-10-11 16:52:24,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 1028 flow [2024-10-11 16:52:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2024-10-11 16:52:24,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8530020703933747 [2024-10-11 16:52:24,743 INFO L175 Difference]: Start difference. First operand has 158 places, 172 transitions, 546 flow. Second operand 3 states and 412 transitions. [2024-10-11 16:52:24,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 1028 flow [2024-10-11 16:52:25,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 222 transitions, 956 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:52:25,003 INFO L231 Difference]: Finished difference. Result has 160 places, 212 transitions, 964 flow [2024-10-11 16:52:25,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=160, PETRI_TRANSITIONS=212} [2024-10-11 16:52:25,004 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, 1 predicate places. [2024-10-11 16:52:25,004 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 212 transitions, 964 flow [2024-10-11 16:52:25,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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 16:52:25,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:25,004 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] [2024-10-11 16:52:25,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 16:52:25,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 16:52:25,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:25,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1966689993, now seen corresponding path program 1 times [2024-10-11 16:52:25,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:25,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588302710] [2024-10-11 16:52:25,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:25,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:25,039 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 16:52:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588302710] [2024-10-11 16:52:25,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588302710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:25,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:25,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435671371] [2024-10-11 16:52:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:25,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:25,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:25,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:25,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:25,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2024-10-11 16:52:25,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 212 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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 16:52:25,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:25,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2024-10-11 16:52:25,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:27,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][141], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 86#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 115#L693-7true, Black: 174#true, 156#true, 179#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-10-11 16:52:27,970 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-10-11 16:52:27,970 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-10-11 16:52:27,970 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-10-11 16:52:27,970 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-10-11 16:52:27,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][142], [162#true, 88#L692-3true, 16#L693-6true, 70#L693-7true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 156#true, 179#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-10-11 16:52:27,987 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-10-11 16:52:27,987 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-10-11 16:52:27,988 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-10-11 16:52:27,988 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-10-11 16:52:28,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][196], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 118#L693-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 156#true, 179#true, 90#L693-4true, 160#true]) [2024-10-11 16:52:28,031 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,031 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,031 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,031 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][216], [162#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 156#true, 179#true, 160#true]) [2024-10-11 16:52:28,059 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,059 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,059 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,059 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][165], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 115#L693-7true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true]) [2024-10-11 16:52:28,202 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,202 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,202 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,203 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][195], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 156#true, 179#true, 160#true]) [2024-10-11 16:52:28,252 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,252 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,252 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,252 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][156], [162#true, 88#L692-3true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#L693-14true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 156#true, 179#true, 160#true]) [2024-10-11 16:52:28,278 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,278 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,278 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,278 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:28,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][71], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#L693-14true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, 160#true]) [2024-10-11 16:52:28,710 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-10-11 16:52:28,711 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-11 16:52:28,711 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-11 16:52:28,711 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-11 16:52:28,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 156#true, 179#true, 160#true]) [2024-10-11 16:52:28,986 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-10-11 16:52:28,987 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-11 16:52:28,987 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-11 16:52:28,987 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-11 16:52:29,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [162#true, 88#L692-3true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 156#true, 179#true, 160#true]) [2024-10-11 16:52:29,035 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-10-11 16:52:29,035 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-11 16:52:29,035 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-11 16:52:29,035 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-11 16:52:29,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][160], [162#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 174#true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 156#true, 179#true, 160#true]) [2024-10-11 16:52:29,322 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2024-10-11 16:52:29,322 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-10-11 16:52:29,323 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-10-11 16:52:29,323 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-10-11 16:52:29,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][160], [162#true, 70#L693-7true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 156#true, 179#true, 160#true]) [2024-10-11 16:52:29,374 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2024-10-11 16:52:29,374 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-10-11 16:52:29,374 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-10-11 16:52:29,374 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-10-11 16:52:29,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][142], [162#true, 16#L693-6true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 179#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-10-11 16:52:29,757 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-11 16:52:29,757 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:29,757 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:29,757 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:29,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][141], [162#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 156#true, 179#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-10-11 16:52:29,815 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-11 16:52:29,815 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:29,815 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:29,815 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:30,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][201], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true]) [2024-10-11 16:52:30,430 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,430 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,430 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,430 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][221], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 156#true, 179#true, 160#true]) [2024-10-11 16:52:30,431 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,431 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,431 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,431 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][165], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true]) [2024-10-11 16:52:30,435 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,435 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,435 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,435 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][195], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 179#true, 160#true]) [2024-10-11 16:52:30,442 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,442 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,442 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,442 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:30,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 179#true, 160#true]) [2024-10-11 16:52:30,878 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,878 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,878 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,878 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][173], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 179#true, 160#true]) [2024-10-11 16:52:30,879 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,880 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,880 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,880 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true]) [2024-10-11 16:52:30,916 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,916 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,916 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,916 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][173], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 174#true, 54#L693-14true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true]) [2024-10-11 16:52:30,917 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,917 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,918 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:30,918 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:33,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][165], [18#L694-3true, 37#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true]) [2024-10-11 16:52:33,383 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,383 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,383 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,383 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][201], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 54#L693-14true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true]) [2024-10-11 16:52:33,385 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,385 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,385 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,385 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][173], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 54#L693-14true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true]) [2024-10-11 16:52:33,964 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,964 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,964 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,964 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [18#L694-3true, 37#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 179#true, 160#true]) [2024-10-11 16:52:33,965 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,966 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,966 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:33,966 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:34,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][165], [37#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true, 28#L701-3true]) [2024-10-11 16:52:34,558 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,558 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,558 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,558 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][201], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 54#L693-14true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true, 28#L701-3true]) [2024-10-11 16:52:34,560 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,560 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,560 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,560 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [37#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 179#true, 28#L701-3true, 160#true]) [2024-10-11 16:52:34,722 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,722 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,722 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,722 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,732 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][173], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 54#L693-14true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 179#true, 28#L701-3true, 160#true]) [2024-10-11 16:52:34,732 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,733 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,733 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:34,733 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-11 16:52:35,813 INFO L124 PetriNetUnfolderBase]: 45404/114068 cut-off events. [2024-10-11 16:52:35,814 INFO L125 PetriNetUnfolderBase]: For 212335/218324 co-relation queries the response was YES. [2024-10-11 16:52:36,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305840 conditions, 114068 events. 45404/114068 cut-off events. For 212335/218324 co-relation queries the response was YES. Maximal size of possible extension queue 3863. Compared 1555807 event pairs, 17118 based on Foata normal form. 381/95247 useless extension candidates. Maximal degree in co-relation 305830. Up to 49201 conditions per place. [2024-10-11 16:52:36,914 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 91 selfloop transitions, 36 changer transitions 0/250 dead transitions. [2024-10-11 16:52:36,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 250 transitions, 1496 flow [2024-10-11 16:52:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2024-10-11 16:52:36,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2024-10-11 16:52:36,916 INFO L175 Difference]: Start difference. First operand has 160 places, 212 transitions, 964 flow. Second operand 3 states and 404 transitions. [2024-10-11 16:52:36,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 250 transitions, 1496 flow [2024-10-11 16:52:37,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 250 transitions, 1386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:52:37,031 INFO L231 Difference]: Finished difference. Result has 162 places, 244 transitions, 1330 flow [2024-10-11 16:52:37,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1330, PETRI_PLACES=162, PETRI_TRANSITIONS=244} [2024-10-11 16:52:37,032 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, 3 predicate places. [2024-10-11 16:52:37,032 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 244 transitions, 1330 flow [2024-10-11 16:52:37,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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 16:52:37,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:37,033 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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] [2024-10-11 16:52:37,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 16:52:37,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 16:52:37,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2101152425, now seen corresponding path program 1 times [2024-10-11 16:52:37,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:37,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589844571] [2024-10-11 16:52:37,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 16:52:37,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:37,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589844571] [2024-10-11 16:52:37,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589844571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:37,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:37,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:37,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344530402] [2024-10-11 16:52:37,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:37,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:37,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:37,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:37,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:37,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2024-10-11 16:52:37,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 244 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 16:52:37,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:37,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2024-10-11 16:52:37,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:52:41,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][297], [162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:41,129 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,129 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,129 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,129 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][295], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 106#L693-4true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:41,210 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,210 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,210 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,211 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][294], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 106#L693-4true, Black: 174#true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:41,219 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,219 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,219 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,219 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-11 16:52:41,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][300], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:41,335 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2024-10-11 16:52:41,335 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-11 16:52:41,335 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-11 16:52:41,335 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-11 16:52:42,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][254], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:42,377 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,377 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,377 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,377 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][281], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:42,423 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,423 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,423 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,423 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][282], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:42,429 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,429 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,429 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,429 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][149], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 115#L693-7true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:42,945 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,945 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,945 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,945 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][150], [162#true, 16#L693-6true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:42,989 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,989 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,989 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:42,989 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][157], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 115#L693-7true, Black: 174#true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:43,451 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,451 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,451 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,452 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][224], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:43,484 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,484 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,484 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,484 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][157], [162#true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:43,612 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,612 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,612 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,612 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][224], [162#true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:43,620 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,620 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,620 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,620 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][149], [162#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:43,626 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,627 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,627 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,627 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-11 16:52:43,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][223], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:43,910 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,910 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,910 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,910 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][211], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 51#L693-14true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:43,966 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,966 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,966 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:43,966 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][163], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 51#L693-14true, Black: 176#(= |#race~c~0| 0), 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 90#L693-4true, Black: 179#true, 160#true, 184#true]) [2024-10-11 16:52:44,021 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,021 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,021 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,021 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][175], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 38#L693-14true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:44,056 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,056 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,056 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,057 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][223], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:44,072 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,072 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,072 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,072 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][176], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:44,079 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,079 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,079 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,079 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-11 16:52:44,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][66], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 57#L693-5true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 51#L693-14true, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 184#true]) [2024-10-11 16:52:44,587 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:44,587 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:44,587 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:44,587 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:44,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][185], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 115#L693-7true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:44,591 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:44,591 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:44,591 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:44,591 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][71], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 38#L693-14true, Black: 176#(= |#race~c~0| 0), 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:45,056 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,056 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,056 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,057 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][185], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:45,061 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,061 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,061 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,061 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][66], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 51#L693-14true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 184#true]) [2024-10-11 16:52:45,091 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,092 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,092 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,092 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][185], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, 115#L693-7true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:45,115 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,115 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,115 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,115 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][71], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 38#L693-14true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:45,173 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,173 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,173 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,173 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][185], [8#L693-5true, 162#true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:45,183 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,183 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,183 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,183 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][123], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:45,197 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,198 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,198 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,198 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][185], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 54#L693-14true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:45,199 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,199 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,199 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,199 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-11 16:52:45,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][313], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 156#true, 179#true, 141#L693-15true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:45,343 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,344 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,344 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,344 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][147], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 96#L694true, 184#true]) [2024-10-11 16:52:45,400 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is not cut-off event [2024-10-11 16:52:45,400 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2024-10-11 16:52:45,400 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2024-10-11 16:52:45,400 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2024-10-11 16:52:45,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][311], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, 90#L693-4true, 141#L693-15true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:45,404 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,404 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,404 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,404 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][314], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 141#L693-15true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:45,537 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2024-10-11 16:52:45,537 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-10-11 16:52:45,537 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-10-11 16:52:45,537 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-10-11 16:52:45,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][147], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:45,773 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is not cut-off event [2024-10-11 16:52:45,773 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2024-10-11 16:52:45,773 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2024-10-11 16:52:45,773 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2024-10-11 16:52:45,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][133], [37#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 87#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 174#true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:45,789 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,789 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,789 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,789 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][132], [37#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 87#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:45,921 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,921 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,921 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:45,921 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-10-11 16:52:46,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][307], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 141#L693-15true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:46,121 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-10-11 16:52:46,121 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-10-11 16:52:46,121 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-10-11 16:52:46,121 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-10-11 16:52:46,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][254], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 96#L694true, 160#true, 103#L693-4true, 184#true]) [2024-10-11 16:52:46,679 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-10-11 16:52:46,679 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-10-11 16:52:46,679 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-10-11 16:52:46,679 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-10-11 16:52:46,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][306], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 141#L693-15true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:46,699 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-10-11 16:52:46,699 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-10-11 16:52:46,699 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-10-11 16:52:46,699 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-10-11 16:52:48,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][176], [18#L694-3true, 37#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:48,735 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-10-11 16:52:48,735 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:48,735 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:48,735 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:48,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][223], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:48,736 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-10-11 16:52:48,736 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:48,736 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:48,736 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-11 16:52:49,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][256], [162#true, 14#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 134#L694-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 141#L693-15true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-10-11 16:52:49,061 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is not cut-off event [2024-10-11 16:52:49,061 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2024-10-11 16:52:49,061 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2024-10-11 16:52:49,061 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2024-10-11 16:52:50,402 INFO L124 PetriNetUnfolderBase]: 57949/139618 cut-off events. [2024-10-11 16:52:50,402 INFO L125 PetriNetUnfolderBase]: For 333537/353528 co-relation queries the response was YES. [2024-10-11 16:52:51,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401619 conditions, 139618 events. 57949/139618 cut-off events. For 333537/353528 co-relation queries the response was YES. Maximal size of possible extension queue 4973. Compared 1913591 event pairs, 16733 based on Foata normal form. 379/112409 useless extension candidates. Maximal degree in co-relation 401608. Up to 59184 conditions per place. [2024-10-11 16:52:51,712 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 112 selfloop transitions, 76 changer transitions 0/315 dead transitions. [2024-10-11 16:52:51,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 315 transitions, 2301 flow [2024-10-11 16:52:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:52:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:52:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2024-10-11 16:52:51,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8467908902691511 [2024-10-11 16:52:51,714 INFO L175 Difference]: Start difference. First operand has 162 places, 244 transitions, 1330 flow. Second operand 3 states and 409 transitions. [2024-10-11 16:52:51,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 315 transitions, 2301 flow [2024-10-11 16:52:55,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 315 transitions, 2097 flow, removed 46 selfloop flow, removed 2 redundant places. [2024-10-11 16:52:55,081 INFO L231 Difference]: Finished difference. Result has 164 places, 308 transitions, 2136 flow [2024-10-11 16:52:55,082 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2136, PETRI_PLACES=164, PETRI_TRANSITIONS=308} [2024-10-11 16:52:55,082 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, 5 predicate places. [2024-10-11 16:52:55,082 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 308 transitions, 2136 flow [2024-10-11 16:52:55,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 16:52:55,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:52:55,083 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] [2024-10-11 16:52:55,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 16:52:55,083 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 16:52:55,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:52:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash 41690411, now seen corresponding path program 1 times [2024-10-11 16:52:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:52:55,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379963171] [2024-10-11 16:52:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:52:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:52:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:52:55,118 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 16:52:55,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:52:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379963171] [2024-10-11 16:52:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379963171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:52:55,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:52:55,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:52:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157272031] [2024-10-11 16:52:55,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:52:55,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:52:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:52:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:52:55,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:52:55,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2024-10-11 16:52:55,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 308 transitions, 2136 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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 16:52:55,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:52:55,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2024-10-11 16:52:55,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand