./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:17:00,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:17:00,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:17:00,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:17:00,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:17:00,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:17:00,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:17:00,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:17:00,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:17:00,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:17:00,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:17:00,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:17:00,774 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:17:00,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:17:00,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:17:00,777 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:17:00,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:17:00,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:17:00,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:17:00,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:17:00,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:17:00,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:17:00,782 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:17:00,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:17:00,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:17:00,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:17:00,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:17:00,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:17:00,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:17:00,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:17:00,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:17:00,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:17:00,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:17:00,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:17:00,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:17:00,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:17:00,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:17:00,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:17:00,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:17:00,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:17:00,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:17:00,788 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 [2024-11-16 23:17:01,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:17:01,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:17:01,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:17:01,061 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:17:01,061 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:17:01,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-11-16 23:17:02,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:17:02,815 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:17:02,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-11-16 23:17:02,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2db91af0/78235333bb894c3b8d041a4ec8385431/FLAG59e7b1fcd [2024-11-16 23:17:02,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2db91af0/78235333bb894c3b8d041a4ec8385431 [2024-11-16 23:17:02,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:17:02,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:17:02,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:17:02,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:17:02,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:17:02,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:17:02" (1/1) ... [2024-11-16 23:17:02,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea3a941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:02, skipping insertion in model container [2024-11-16 23:17:02,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:17:02" (1/1) ... [2024-11-16 23:17:02,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:17:03,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:17:03,292 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:17:03,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:17:03,373 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:17:03,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03 WrapperNode [2024-11-16 23:17:03,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:17:03,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:17:03,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:17:03,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:17:03,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (1/1) ... [2024-11-16 23:17:03,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (1/1) ... [2024-11-16 23:17:03,418 INFO L138 Inliner]: procedures = 164, calls = 17, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 86 [2024-11-16 23:17:03,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:17:03,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:17:03,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:17:03,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:17:03,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (1/1) ... [2024-11-16 23:17:03,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (1/1) ... [2024-11-16 23:17:03,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (1/1) ... [2024-11-16 23:17:03,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (1/1) ... [2024-11-16 23:17:03,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (1/1) ... [2024-11-16 23:17:03,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (1/1) ... [2024-11-16 23:17:03,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (1/1) ... [2024-11-16 23:17:03,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (1/1) ... [2024-11-16 23:17:03,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:17:03,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:17:03,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:17:03,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:17:03,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (1/1) ... [2024-11-16 23:17:03,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:17:03,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:17:03,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:17:03,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:17:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-16 23:17:03,523 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-16 23:17:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 23:17:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:17:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:17:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 23:17:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:17:03,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:17:03,525 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:17:03,629 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:17:03,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:17:03,826 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:17:03,827 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:17:03,900 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:17:03,900 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:17:03,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:17:03 BoogieIcfgContainer [2024-11-16 23:17:03,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:17:03,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:17:03,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:17:03,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:17:03,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:17:02" (1/3) ... [2024-11-16 23:17:03,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528a9dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:17:03, skipping insertion in model container [2024-11-16 23:17:03,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:17:03" (2/3) ... [2024-11-16 23:17:03,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528a9dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:17:03, skipping insertion in model container [2024-11-16 23:17:03,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:17:03" (3/3) ... [2024-11-16 23:17:03,911 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2024-11-16 23:17:03,927 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:17:03,927 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-16 23:17:03,927 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:17:03,995 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 23:17:04,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 99 transitions, 202 flow [2024-11-16 23:17:04,079 INFO L124 PetriNetUnfolderBase]: 8/149 cut-off events. [2024-11-16 23:17:04,079 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:17:04,085 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 364 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-11-16 23:17:04,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 99 transitions, 202 flow [2024-11-16 23:17:04,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 202 flow [2024-11-16 23:17:04,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:17:04,102 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;@a35ec50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:17:04,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-16 23:17:04,113 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:17:04,113 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-16 23:17:04,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:17:04,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:04,114 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-11-16 23:17:04,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:17:04,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:04,120 INFO L85 PathProgramCache]: Analyzing trace with hash -852700610, now seen corresponding path program 1 times [2024-11-16 23:17:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:04,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393544200] [2024-11-16 23:17:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:04,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:04,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393544200] [2024-11-16 23:17:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393544200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:04,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:04,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:04,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501311400] [2024-11-16 23:17:04,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:04,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:17:04,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:04,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:17:04,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:17:04,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2024-11-16 23:17:04,366 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-11-16 23:17:04,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:04,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2024-11-16 23:17:04,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:04,437 INFO L124 PetriNetUnfolderBase]: 4/189 cut-off events. [2024-11-16 23:17:04,437 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:17:04,438 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 8. Compared 551 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-11-16 23:17:04,439 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 5 selfloop transitions, 0 changer transitions 0/90 dead transitions. [2024-11-16 23:17:04,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 194 flow [2024-11-16 23:17:04,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:17:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:17:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2024-11-16 23:17:04,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2024-11-16 23:17:04,456 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 202 flow. Second operand 2 states and 184 transitions. [2024-11-16 23:17:04,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 194 flow [2024-11-16 23:17:04,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:17:04,465 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 184 flow [2024-11-16 23:17:04,467 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-11-16 23:17:04,473 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2024-11-16 23:17:04,474 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 184 flow [2024-11-16 23:17:04,474 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-11-16 23:17:04,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:04,475 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-11-16 23:17:04,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:17:04,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:17:04,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2144272070, now seen corresponding path program 1 times [2024-11-16 23:17:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702448707] [2024-11-16 23:17:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702448707] [2024-11-16 23:17:04,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702448707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:04,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:04,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:04,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346320857] [2024-11-16 23:17:04,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:04,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:04,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:04,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:04,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 99 [2024-11-16 23:17:04,621 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-11-16 23:17:04,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:04,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 99 [2024-11-16 23:17:04,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:04,731 INFO L124 PetriNetUnfolderBase]: 59/448 cut-off events. [2024-11-16 23:17:04,732 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:17:04,735 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 24. Compared 2343 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-11-16 23:17:04,738 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2024-11-16 23:17:04,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 246 flow [2024-11-16 23:17:04,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2024-11-16 23:17:04,741 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8417508417508418 [2024-11-16 23:17:04,741 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 184 flow. Second operand 3 states and 250 transitions. [2024-11-16 23:17:04,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 246 flow [2024-11-16 23:17:04,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:17:04,745 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 230 flow [2024-11-16 23:17:04,745 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-11-16 23:17:04,746 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2024-11-16 23:17:04,746 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 230 flow [2024-11-16 23:17:04,747 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-11-16 23:17:04,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:04,747 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-11-16 23:17:04,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:17:04,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:17:04,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2044079219, now seen corresponding path program 1 times [2024-11-16 23:17:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:04,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363352050] [2024-11-16 23:17:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:04,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363352050] [2024-11-16 23:17:04,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363352050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:04,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443399105] [2024-11-16 23:17:04,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:04,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:04,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:04,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:04,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 99 [2024-11-16 23:17:04,879 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-11-16 23:17:04,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:04,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 99 [2024-11-16 23:17:04,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:04,980 INFO L124 PetriNetUnfolderBase]: 64/427 cut-off events. [2024-11-16 23:17:04,980 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2024-11-16 23:17:04,981 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 27. Compared 2338 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-11-16 23:17:04,983 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2024-11-16 23:17:04,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 102 transitions, 298 flow [2024-11-16 23:17:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2024-11-16 23:17:04,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8552188552188552 [2024-11-16 23:17:04,990 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 230 flow. Second operand 3 states and 254 transitions. [2024-11-16 23:17:04,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 102 transitions, 298 flow [2024-11-16 23:17:04,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 102 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:17:04,996 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 270 flow [2024-11-16 23:17:04,997 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-11-16 23:17:04,998 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places. [2024-11-16 23:17:04,998 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 270 flow [2024-11-16 23:17:04,998 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-11-16 23:17:04,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:04,999 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-11-16 23:17:05,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:17:05,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:17:05,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:05,001 INFO L85 PathProgramCache]: Analyzing trace with hash 860291118, now seen corresponding path program 1 times [2024-11-16 23:17:05,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:05,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378501893] [2024-11-16 23:17:05,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:05,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:17:05,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:17:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:17:05,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:17:05,067 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:17:05,068 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-16 23:17:05,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-16 23:17:05,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-16 23:17:05,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-16 23:17:05,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-16 23:17:05,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-16 23:17:05,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-16 23:17:05,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-16 23:17:05,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-16 23:17:05,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-16 23:17:05,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:17:05,072 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 23:17:05,075 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:17:05,075 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:17:05,122 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 23:17:05,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 130 transitions, 270 flow [2024-11-16 23:17:05,159 INFO L124 PetriNetUnfolderBase]: 13/230 cut-off events. [2024-11-16 23:17:05,160 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:17:05,162 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 764 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-11-16 23:17:05,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 130 transitions, 270 flow [2024-11-16 23:17:05,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 130 transitions, 270 flow [2024-11-16 23:17:05,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:17:05,168 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;@a35ec50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:17:05,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-16 23:17:05,176 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:17:05,176 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-16 23:17:05,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:17:05,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:05,177 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-11-16 23:17:05,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:17:05,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash -712571458, now seen corresponding path program 1 times [2024-11-16 23:17:05,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:05,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286974851] [2024-11-16 23:17:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:05,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286974851] [2024-11-16 23:17:05,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286974851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:05,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:05,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:05,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438828041] [2024-11-16 23:17:05,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:05,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:17:05,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:05,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:17:05,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:17:05,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130 [2024-11-16 23:17:05,210 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-11-16 23:17:05,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:05,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130 [2024-11-16 23:17:05,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:05,302 INFO L124 PetriNetUnfolderBase]: 34/566 cut-off events. [2024-11-16 23:17:05,303 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-16 23:17:05,305 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 3251 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-11-16 23:17:05,308 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 8 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2024-11-16 23:17:05,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 260 flow [2024-11-16 23:17:05,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:17:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:17:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2024-11-16 23:17:05,311 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9192307692307692 [2024-11-16 23:17:05,311 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 270 flow. Second operand 2 states and 239 transitions. [2024-11-16 23:17:05,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 260 flow [2024-11-16 23:17:05,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:17:05,315 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 244 flow [2024-11-16 23:17:05,315 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-11-16 23:17:05,316 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2024-11-16 23:17:05,316 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 244 flow [2024-11-16 23:17:05,316 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-11-16 23:17:05,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:05,316 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-11-16 23:17:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:17:05,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:17:05,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2030179836, now seen corresponding path program 1 times [2024-11-16 23:17:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149876067] [2024-11-16 23:17:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:05,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:05,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149876067] [2024-11-16 23:17:05,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149876067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:05,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:05,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271908650] [2024-11-16 23:17:05,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:05,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:05,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:05,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:05,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-11-16 23:17:05,425 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-11-16 23:17:05,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:05,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-11-16 23:17:05,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:05,803 INFO L124 PetriNetUnfolderBase]: 845/3283 cut-off events. [2024-11-16 23:17:05,804 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-16 23:17:05,813 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 129. Compared 29852 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-11-16 23:17:05,830 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 26 selfloop transitions, 9 changer transitions 0/129 dead transitions. [2024-11-16 23:17:05,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 338 flow [2024-11-16 23:17:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2024-11-16 23:17:05,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2024-11-16 23:17:05,832 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 244 flow. Second operand 3 states and 327 transitions. [2024-11-16 23:17:05,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 338 flow [2024-11-16 23:17:05,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 129 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:17:05,835 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 314 flow [2024-11-16 23:17:05,835 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-11-16 23:17:05,836 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places. [2024-11-16 23:17:05,836 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 314 flow [2024-11-16 23:17:05,837 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-11-16 23:17:05,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:05,837 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-11-16 23:17:05,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:17:05,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:17:05,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1002423949, now seen corresponding path program 1 times [2024-11-16 23:17:05,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:05,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918948375] [2024-11-16 23:17:05,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:05,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:05,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:05,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918948375] [2024-11-16 23:17:05,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918948375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:05,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:05,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977905534] [2024-11-16 23:17:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:05,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:05,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:05,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:05,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:05,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-11-16 23:17:05,912 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-11-16 23:17:05,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:05,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-11-16 23:17:05,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:06,369 INFO L124 PetriNetUnfolderBase]: 1088/3830 cut-off events. [2024-11-16 23:17:06,370 INFO L125 PetriNetUnfolderBase]: For 861/1014 co-relation queries the response was YES. [2024-11-16 23:17:06,379 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 36062 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-11-16 23:17:06,396 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 30 selfloop transitions, 13 changer transitions 0/141 dead transitions. [2024-11-16 23:17:06,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 141 transitions, 459 flow [2024-11-16 23:17:06,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-11-16 23:17:06,399 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-11-16 23:17:06,399 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 314 flow. Second operand 3 states and 332 transitions. [2024-11-16 23:17:06,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 141 transitions, 459 flow [2024-11-16 23:17:06,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 141 transitions, 433 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:17:06,412 INFO L231 Difference]: Finished difference. Result has 129 places, 136 transitions, 408 flow [2024-11-16 23:17:06,412 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-11-16 23:17:06,414 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2024-11-16 23:17:06,414 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 136 transitions, 408 flow [2024-11-16 23:17:06,414 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-11-16 23:17:06,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:06,415 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-11-16 23:17:06,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:17:06,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:17:06,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash -641752375, now seen corresponding path program 1 times [2024-11-16 23:17:06,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:06,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289728411] [2024-11-16 23:17:06,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:06,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289728411] [2024-11-16 23:17:06,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289728411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:06,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:06,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:06,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122635415] [2024-11-16 23:17:06,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:06,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:06,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:06,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:06,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:06,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-11-16 23:17:06,507 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-11-16 23:17:06,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:06,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-11-16 23:17:06,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:07,323 INFO L124 PetriNetUnfolderBase]: 2061/6890 cut-off events. [2024-11-16 23:17:07,324 INFO L125 PetriNetUnfolderBase]: For 3804/3984 co-relation queries the response was YES. [2024-11-16 23:17:07,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13659 conditions, 6890 events. 2061/6890 cut-off events. For 3804/3984 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 72244 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-11-16 23:17:07,375 INFO L140 encePairwiseOnDemand]: 115/130 looper letters, 44 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2024-11-16 23:17:07,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 168 transitions, 707 flow [2024-11-16 23:17:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2024-11-16 23:17:07,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8615384615384616 [2024-11-16 23:17:07,377 INFO L175 Difference]: Start difference. First operand has 129 places, 136 transitions, 408 flow. Second operand 3 states and 336 transitions. [2024-11-16 23:17:07,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 168 transitions, 707 flow [2024-11-16 23:17:07,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 168 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:17:07,389 INFO L231 Difference]: Finished difference. Result has 131 places, 161 transitions, 664 flow [2024-11-16 23:17:07,390 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-11-16 23:17:07,391 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2024-11-16 23:17:07,391 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 161 transitions, 664 flow [2024-11-16 23:17:07,392 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-11-16 23:17:07,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:07,394 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-11-16 23:17:07,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:17:07,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:17:07,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:07,395 INFO L85 PathProgramCache]: Analyzing trace with hash 986936518, now seen corresponding path program 1 times [2024-11-16 23:17:07,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:07,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740980724] [2024-11-16 23:17:07,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:07,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:07,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740980724] [2024-11-16 23:17:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740980724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:07,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520304745] [2024-11-16 23:17:07,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:07,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:07,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:07,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:07,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:07,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-11-16 23:17:07,485 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-11-16 23:17:07,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:07,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-11-16 23:17:07,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:08,491 INFO L124 PetriNetUnfolderBase]: 2966/9755 cut-off events. [2024-11-16 23:17:08,491 INFO L125 PetriNetUnfolderBase]: For 14889/15378 co-relation queries the response was YES. [2024-11-16 23:17:08,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23389 conditions, 9755 events. 2966/9755 cut-off events. For 14889/15378 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 106069 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-11-16 23:17:08,628 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 60 selfloop transitions, 22 changer transitions 0/183 dead transitions. [2024-11-16 23:17:08,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 183 transitions, 976 flow [2024-11-16 23:17:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2024-11-16 23:17:08,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2024-11-16 23:17:08,630 INFO L175 Difference]: Start difference. First operand has 131 places, 161 transitions, 664 flow. Second operand 3 states and 327 transitions. [2024-11-16 23:17:08,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 183 transitions, 976 flow [2024-11-16 23:17:08,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 183 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:17:08,645 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 862 flow [2024-11-16 23:17:08,647 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-11-16 23:17:08,648 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2024-11-16 23:17:08,648 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 862 flow [2024-11-16 23:17:08,650 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-11-16 23:17:08,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:08,650 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-11-16 23:17:08,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:17:08,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:17:08,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:08,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1271312882, now seen corresponding path program 1 times [2024-11-16 23:17:08,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:08,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756994844] [2024-11-16 23:17:08,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 23:17:08,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756994844] [2024-11-16 23:17:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756994844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387503705] [2024-11-16 23:17:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:08,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:08,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:08,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-11-16 23:17:08,754 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-11-16 23:17:08,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:08,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-11-16 23:17:08,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:09,882 INFO L124 PetriNetUnfolderBase]: 3533/10646 cut-off events. [2024-11-16 23:17:09,882 INFO L125 PetriNetUnfolderBase]: For 19372/19822 co-relation queries the response was YES. [2024-11-16 23:17:09,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27773 conditions, 10646 events. 3533/10646 cut-off events. For 19372/19822 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 115823 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-11-16 23:17:10,132 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 68 selfloop transitions, 36 changer transitions 0/209 dead transitions. [2024-11-16 23:17:10,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 209 transitions, 1284 flow [2024-11-16 23:17:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2024-11-16 23:17:10,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8487179487179487 [2024-11-16 23:17:10,137 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 862 flow. Second operand 3 states and 331 transitions. [2024-11-16 23:17:10,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 209 transitions, 1284 flow [2024-11-16 23:17:10,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 209 transitions, 1184 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-11-16 23:17:10,181 INFO L231 Difference]: Finished difference. Result has 135 places, 205 transitions, 1166 flow [2024-11-16 23:17:10,181 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-11-16 23:17:10,182 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2024-11-16 23:17:10,182 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 205 transitions, 1166 flow [2024-11-16 23:17:10,183 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-11-16 23:17:10,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:10,183 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-11-16 23:17:10,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:17:10,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:17:10,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash -607956650, now seen corresponding path program 1 times [2024-11-16 23:17:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:10,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963423509] [2024-11-16 23:17:10,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:10,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:10,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-11-16 23:17:10,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:10,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963423509] [2024-11-16 23:17:10,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963423509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:10,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:10,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257008073] [2024-11-16 23:17:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:10,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:10,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:10,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:10,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:10,256 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-11-16 23:17:10,257 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-11-16 23:17:10,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:10,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-11-16 23:17:10,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:11,504 INFO L124 PetriNetUnfolderBase]: 4494/13130 cut-off events. [2024-11-16 23:17:11,504 INFO L125 PetriNetUnfolderBase]: For 33558/34155 co-relation queries the response was YES. [2024-11-16 23:17:11,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37401 conditions, 13130 events. 4494/13130 cut-off events. For 33558/34155 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 144781 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-11-16 23:17:11,608 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 91 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2024-11-16 23:17:11,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 236 transitions, 1685 flow [2024-11-16 23:17:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-11-16 23:17:11,610 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-11-16 23:17:11,610 INFO L175 Difference]: Start difference. First operand has 135 places, 205 transitions, 1166 flow. Second operand 3 states and 332 transitions. [2024-11-16 23:17:11,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 236 transitions, 1685 flow [2024-11-16 23:17:11,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 236 transitions, 1597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:17:11,637 INFO L231 Difference]: Finished difference. Result has 137 places, 231 transitions, 1530 flow [2024-11-16 23:17:11,637 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-11-16 23:17:11,638 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2024-11-16 23:17:11,638 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 231 transitions, 1530 flow [2024-11-16 23:17:11,639 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-11-16 23:17:11,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:11,639 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-11-16 23:17:11,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:17:11,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:17:11,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:11,640 INFO L85 PathProgramCache]: Analyzing trace with hash -953756051, now seen corresponding path program 1 times [2024-11-16 23:17:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:11,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551389189] [2024-11-16 23:17:11,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:11,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:17:11,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:17:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:17:11,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:17:11,678 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:17:11,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-11-16 23:17:11,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-16 23:17:11,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-16 23:17:11,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-16 23:17:11,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-16 23:17:11,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-16 23:17:11,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-16 23:17:11,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-11-16 23:17:11,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-16 23:17:11,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-16 23:17:11,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-16 23:17:11,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-16 23:17:11,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-16 23:17:11,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:17:11,683 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:17:11,683 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:17:11,683 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-16 23:17:11,717 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 23:17:11,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 161 transitions, 340 flow [2024-11-16 23:17:11,755 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2024-11-16 23:17:11,755 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-16 23:17:11,757 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 13. Compared 1193 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-11-16 23:17:11,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 161 transitions, 340 flow [2024-11-16 23:17:11,759 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 161 transitions, 340 flow [2024-11-16 23:17:11,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:17:11,763 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;@a35ec50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:17:11,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-16 23:17:11,767 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:17:11,767 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-16 23:17:11,767 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:17:11,767 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:11,767 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-11-16 23:17:11,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:17:11,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash 716425086, now seen corresponding path program 1 times [2024-11-16 23:17:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:11,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378120307] [2024-11-16 23:17:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:11,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:11,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378120307] [2024-11-16 23:17:11,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378120307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:11,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:11,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37728116] [2024-11-16 23:17:11,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:11,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:17:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:11,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:17:11,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:17:11,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2024-11-16 23:17:11,803 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-11-16 23:17:11,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:11,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2024-11-16 23:17:11,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:11,994 INFO L124 PetriNetUnfolderBase]: 178/1732 cut-off events. [2024-11-16 23:17:11,994 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-16 23:17:12,001 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 14450 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-11-16 23:17:12,009 INFO L140 encePairwiseOnDemand]: 152/161 looper letters, 11 selfloop transitions, 0 changer transitions 0/144 dead transitions. [2024-11-16 23:17:12,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 328 flow [2024-11-16 23:17:12,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:17:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:17:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2024-11-16 23:17:12,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2024-11-16 23:17:12,011 INFO L175 Difference]: Start difference. First operand has 159 places, 161 transitions, 340 flow. Second operand 2 states and 294 transitions. [2024-11-16 23:17:12,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 328 flow [2024-11-16 23:17:12,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 144 transitions, 326 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-16 23:17:12,014 INFO L231 Difference]: Finished difference. Result has 152 places, 144 transitions, 304 flow [2024-11-16 23:17:12,014 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-11-16 23:17:12,015 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -7 predicate places. [2024-11-16 23:17:12,015 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 304 flow [2024-11-16 23:17:12,015 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-11-16 23:17:12,015 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:12,015 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-11-16 23:17:12,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:17:12,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:17:12,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1550544061, now seen corresponding path program 1 times [2024-11-16 23:17:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:12,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379399404] [2024-11-16 23:17:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:12,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379399404] [2024-11-16 23:17:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379399404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:12,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:12,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874057086] [2024-11-16 23:17:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:12,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:12,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:12,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2024-11-16 23:17:12,112 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-11-16 23:17:12,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:12,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2024-11-16 23:17:12,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:14,125 INFO L124 PetriNetUnfolderBase]: 8153/23044 cut-off events. [2024-11-16 23:17:14,125 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-16 23:17:14,177 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 265884 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-11-16 23:17:14,363 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 34 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2024-11-16 23:17:14,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 161 transitions, 430 flow [2024-11-16 23:17:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2024-11-16 23:17:14,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2024-11-16 23:17:14,365 INFO L175 Difference]: Start difference. First operand has 152 places, 144 transitions, 304 flow. Second operand 3 states and 404 transitions. [2024-11-16 23:17:14,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 161 transitions, 430 flow [2024-11-16 23:17:14,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 161 transitions, 430 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:17:14,368 INFO L231 Difference]: Finished difference. Result has 156 places, 155 transitions, 398 flow [2024-11-16 23:17:14,369 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-11-16 23:17:14,370 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -3 predicate places. [2024-11-16 23:17:14,370 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 155 transitions, 398 flow [2024-11-16 23:17:14,370 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-11-16 23:17:14,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:14,371 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-11-16 23:17:14,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:17:14,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:17:14,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash -236680529, now seen corresponding path program 1 times [2024-11-16 23:17:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:14,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707700657] [2024-11-16 23:17:14,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:14,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:14,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707700657] [2024-11-16 23:17:14,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707700657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:14,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:14,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:14,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39052910] [2024-11-16 23:17:14,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:14,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:14,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:14,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:14,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:14,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2024-11-16 23:17:14,449 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-11-16 23:17:14,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:14,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2024-11-16 23:17:14,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:16,981 INFO L124 PetriNetUnfolderBase]: 11247/29861 cut-off events. [2024-11-16 23:17:16,982 INFO L125 PetriNetUnfolderBase]: For 7893/9108 co-relation queries the response was YES. [2024-11-16 23:17:17,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56111 conditions, 29861 events. 11247/29861 cut-off events. For 7893/9108 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 351832 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-11-16 23:17:17,361 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 42 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2024-11-16 23:17:17,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 180 transitions, 620 flow [2024-11-16 23:17:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2024-11-16 23:17:17,363 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8488612836438924 [2024-11-16 23:17:17,363 INFO L175 Difference]: Start difference. First operand has 156 places, 155 transitions, 398 flow. Second operand 3 states and 410 transitions. [2024-11-16 23:17:17,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 180 transitions, 620 flow [2024-11-16 23:17:17,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 180 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:17:17,437 INFO L231 Difference]: Finished difference. Result has 158 places, 172 transitions, 546 flow [2024-11-16 23:17:17,437 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-11-16 23:17:17,438 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -1 predicate places. [2024-11-16 23:17:17,438 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 172 transitions, 546 flow [2024-11-16 23:17:17,439 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-11-16 23:17:17,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:17,439 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-11-16 23:17:17,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:17:17,439 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:17:17,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:17,440 INFO L85 PathProgramCache]: Analyzing trace with hash -114771735, now seen corresponding path program 1 times [2024-11-16 23:17:17,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:17,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431803409] [2024-11-16 23:17:17,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:17,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:17,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431803409] [2024-11-16 23:17:17,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431803409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:17,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:17,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:17,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414081493] [2024-11-16 23:17:17,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:17,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:17,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:17,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:17,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:17,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 161 [2024-11-16 23:17:17,521 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-11-16 23:17:17,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:17,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 161 [2024-11-16 23:17:17,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:20,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][148], [111#L693-7true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 151#L693-6true, 149#L693-6true, 176#(= |#race~c~0| 0), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true]) [2024-11-16 23:17:20,935 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-16 23:17:20,936 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:20,936 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:20,936 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:21,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][214], [4#L693-9true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 43#L693-1true, 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2024-11-16 23:17:21,181 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:21,182 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:21,182 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:21,182 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:21,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][196], [4#L693-9true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 10#L693-1true, 158#true]) [2024-11-16 23:17:21,191 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:21,191 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:21,192 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:21,192 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:21,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][125], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 10#L693-1true, 158#true]) [2024-11-16 23:17:21,811 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:21,811 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:21,811 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:21,811 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:21,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][174], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 149#L693-6true, 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2024-11-16 23:17:21,813 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:21,813 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:21,814 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:21,814 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:24,346 INFO L124 PetriNetUnfolderBase]: 31822/78787 cut-off events. [2024-11-16 23:17:24,346 INFO L125 PetriNetUnfolderBase]: For 55673/57361 co-relation queries the response was YES. [2024-11-16 23:17:24,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171117 conditions, 78787 events. 31822/78787 cut-off events. For 55673/57361 co-relation queries the response was YES. Maximal size of possible extension queue 2883. Compared 1032028 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-11-16 23:17:24,938 INFO L140 encePairwiseOnDemand]: 141/161 looper letters, 65 selfloop transitions, 40 changer transitions 0/222 dead transitions. [2024-11-16 23:17:24,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 1028 flow [2024-11-16 23:17:24,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2024-11-16 23:17:24,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8530020703933747 [2024-11-16 23:17:24,940 INFO L175 Difference]: Start difference. First operand has 158 places, 172 transitions, 546 flow. Second operand 3 states and 412 transitions. [2024-11-16 23:17:24,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 1028 flow [2024-11-16 23:17:25,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 222 transitions, 956 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:17:25,129 INFO L231 Difference]: Finished difference. Result has 160 places, 212 transitions, 964 flow [2024-11-16 23:17:25,129 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-11-16 23:17:25,130 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, 1 predicate places. [2024-11-16 23:17:25,130 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 212 transitions, 964 flow [2024-11-16 23:17:25,130 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-11-16 23:17:25,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:25,130 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-11-16 23:17:25,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:17:25,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:17:25,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash 527145735, now seen corresponding path program 1 times [2024-11-16 23:17:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:25,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150937033] [2024-11-16 23:17:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:25,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150937033] [2024-11-16 23:17:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150937033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858523221] [2024-11-16 23:17:25,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:25,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:25,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2024-11-16 23:17:25,227 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-11-16 23:17:25,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:25,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2024-11-16 23:17:25,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:28,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][141], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 40#L692true, Black: 174#true, 156#true, 179#true, 15#L693-6true, 160#true, 176#(= |#race~c~0| 0)]) [2024-11-16 23:17:28,267 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-16 23:17:28,267 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:17:28,267 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:17:28,267 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:17:28,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][142], [111#L693-7true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 81#L693-6true, 158#true, 40#L692true, Black: 174#true, 156#true, 179#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-11-16 23:17:28,290 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-16 23:17:28,290 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:17:28,290 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:17:28,290 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:17:28,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-10: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, 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|), 107#L693-9true, 149#L693-6true, 97#L693-10true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 15#L693-6true, 160#true]) [2024-11-16 23:17:28,333 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,333 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,333 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,333 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-10: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][216], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 97#L693-10true, 174#true, 81#L693-6true, 158#true, Black: 176#(= |#race~c~0| 0), 4#L693-9true, 156#true, 179#true, 160#true]) [2024-11-16 23:17:28,369 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,369 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,369 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,369 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][165], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 10#L693-1true, 40#L692true, Black: 176#(= |#race~c~0| 0), 15#L693-6true, 179#true, 156#true, 160#true]) [2024-11-16 23:17:28,595 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,595 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,596 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,596 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, 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|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 81#L693-6true, 10#L693-1true, 158#true, 40#L692true, Black: 176#(= |#race~c~0| 0), 4#L693-9true, 156#true, 179#true, 160#true]) [2024-11-16 23:17:28,643 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,643 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,643 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,643 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][156], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 40#L692true, Black: 176#(= |#race~c~0| 0), 4#L693-9true, 156#true, 179#true, 160#true, 22#L693-1true]) [2024-11-16 23:17:28,672 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,672 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,672 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,672 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:28,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][71], [162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 40#L692true, 179#true, 156#true, 160#true, 22#L693-1true]) [2024-11-16 23:17:28,828 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-16 23:17:28,828 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-16 23:17:28,828 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-16 23:17:28,828 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-16 23:17:29,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 10#L693-1true, 158#true, Black: 176#(= |#race~c~0| 0), 40#L692true, 156#true, 179#true, 15#L693-6true, 160#true]) [2024-11-16 23:17:29,036 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-16 23:17:29,036 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-16 23:17:29,036 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-16 23:17:29,036 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-16 23:17:29,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 81#L693-6true, 158#true, 10#L693-1true, 40#L692true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true]) [2024-11-16 23:17:29,071 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-16 23:17:29,071 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-16 23:17:29,071 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-16 23:17:29,071 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-16 23:17:29,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-10: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][160], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 97#L693-10true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 15#L693-6true, 160#true]) [2024-11-16 23:17:29,617 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2024-11-16 23:17:29,617 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-16 23:17:29,617 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-16 23:17:29,617 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-16 23:17:29,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-10: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][160], [162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 97#L693-10true, 174#true, 81#L693-6true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true]) [2024-11-16 23:17:29,662 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2024-11-16 23:17:29,662 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-16 23:17:29,662 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-16 23:17:29,662 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-16 23:17:29,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][142], [111#L693-7true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, 149#L693-6true, 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-11-16 23:17:29,937 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-16 23:17:29,937 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:29,937 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:29,937 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:29,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][141], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 151#L693-6true, 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 156#true, 179#true, 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 176#(= |#race~c~0| 0)]) [2024-11-16 23:17:29,979 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-16 23:17:29,979 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:29,980 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:29,980 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:30,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][201], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-16 23:17:30,250 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,250 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,250 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,250 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][221], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 4#L693-9true, 156#true, 179#true, 160#true]) [2024-11-16 23:17:30,251 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,251 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,251 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,251 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][165], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 10#L693-1true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-16 23:17:30,255 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,255 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,255 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,255 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][195], [114#thr1Err2ASSERT_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|), 174#true, 10#L693-1true, 158#true, Black: 176#(= |#race~c~0| 0), 4#L693-9true, 156#true, 179#true, 160#true]) [2024-11-16 23:17:30,263 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,263 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,263 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:30,263 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:31,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 10#L693-1true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2024-11-16 23:17:31,039 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,039 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,039 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,040 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][173], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true]) [2024-11-16 23:17:31,041 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,041 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,041 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,041 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [139#L693-8true, 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|), 174#true, 10#L693-1true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-16 23:17:31,078 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,078 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,079 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,079 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][173], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-16 23:17:31,080 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,080 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,080 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:31,080 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:34,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][165], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 10#L693-1true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L694true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 160#true]) [2024-11-16 23:17:34,047 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,047 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,047 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,047 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, 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|), 107#L693-9true, 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L694true, 160#true]) [2024-11-16 23:17:34,048 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,048 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,048 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,048 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][173], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L694true, 160#true]) [2024-11-16 23:17:34,231 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,231 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,232 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,232 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 10#L693-1true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L694true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 160#true]) [2024-11-16 23:17:34,232 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,232 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,232 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,232 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:34,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][165], [20#L701-1true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 10#L693-1true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 160#true]) [2024-11-16 23:17:34,653 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,653 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,653 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,653 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][201], [20#L701-1true, 162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true]) [2024-11-16 23:17:34,655 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,655 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,655 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,655 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][120], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 20#L701-1true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 10#L693-1true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 160#true]) [2024-11-16 23:17:34,775 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,775 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,775 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,775 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][173], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 20#L701-1true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true]) [2024-11-16 23:17:34,784 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,784 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,784 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:34,784 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:17:35,774 INFO L124 PetriNetUnfolderBase]: 45404/114068 cut-off events. [2024-11-16 23:17:35,775 INFO L125 PetriNetUnfolderBase]: For 214578/220567 co-relation queries the response was YES. [2024-11-16 23:17:36,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305840 conditions, 114068 events. 45404/114068 cut-off events. For 214578/220567 co-relation queries the response was YES. Maximal size of possible extension queue 3863. Compared 1555266 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-11-16 23:17:36,801 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 91 selfloop transitions, 36 changer transitions 0/250 dead transitions. [2024-11-16 23:17:36,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 250 transitions, 1496 flow [2024-11-16 23:17:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2024-11-16 23:17:36,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2024-11-16 23:17:36,803 INFO L175 Difference]: Start difference. First operand has 160 places, 212 transitions, 964 flow. Second operand 3 states and 404 transitions. [2024-11-16 23:17:36,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 250 transitions, 1496 flow [2024-11-16 23:17:36,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 250 transitions, 1386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:17:36,908 INFO L231 Difference]: Finished difference. Result has 162 places, 244 transitions, 1330 flow [2024-11-16 23:17:36,909 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-11-16 23:17:36,909 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, 3 predicate places. [2024-11-16 23:17:36,909 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 244 transitions, 1330 flow [2024-11-16 23:17:36,909 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-11-16 23:17:36,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:36,910 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-11-16 23:17:36,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:17:36,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:17:36,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:36,910 INFO L85 PathProgramCache]: Analyzing trace with hash -840725362, now seen corresponding path program 1 times [2024-11-16 23:17:36,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:36,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96094577] [2024-11-16 23:17:36,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:36,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 23:17:36,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96094577] [2024-11-16 23:17:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96094577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:36,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:36,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:36,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315169634] [2024-11-16 23:17:36,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:36,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:36,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:36,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:36,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:36,991 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2024-11-16 23:17:36,992 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-11-16 23:17:36,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:36,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2024-11-16 23:17:36,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:17:41,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][297], [111#L693-7true, 162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, 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, 93#L693-9true, 184#true]) [2024-11-16 23:17:41,123 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,123 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,123 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,123 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][295], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 4#L693-9true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 93#L693-9true, 184#true]) [2024-11-16 23:17:41,184 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,184 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,184 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,184 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,190 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][294], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 4#L693-9true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 68#L693-7true]) [2024-11-16 23:17:41,190 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,190 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,190 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,190 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-16 23:17:41,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][300], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 4#L693-9true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 93#L693-9true, 184#true]) [2024-11-16 23:17:41,274 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2024-11-16 23:17:41,274 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-16 23:17:41,274 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-16 23:17:41,274 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-16 23:17:42,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][254], [162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-9true, 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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, 93#L693-9true, 184#true]) [2024-11-16 23:17:42,254 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-16 23:17:42,254 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:42,254 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:42,254 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:42,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][281], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 4#L693-9true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-16 23:17:42,298 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-16 23:17:42,298 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:42,298 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:42,298 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:42,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][282], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 4#L693-9true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 93#L693-9true, 184#true]) [2024-11-16 23:17:42,303 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-16 23:17:42,303 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:42,303 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:42,303 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][149], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 174#true, 179#true, 15#L693-6true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-16 23:17:43,186 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,186 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,186 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,186 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][150], [111#L693-7true, 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|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 81#L693-6true, 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-11-16 23:17:43,226 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,226 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,226 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,226 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][157], [114#thr1Err2ASSERT_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|), 158#true, Black: 174#true, 179#true, 15#L693-6true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 68#L693-7true]) [2024-11-16 23:17:43,261 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,261 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,261 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,261 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][224], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 15#L693-6true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 93#L693-9true, 184#true]) [2024-11-16 23:17:43,275 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,275 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,275 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,275 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][157], [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|), 81#L693-6true, 158#true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true, 68#L693-7true]) [2024-11-16 23:17:43,343 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,343 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,344 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,344 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, 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|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 81#L693-6true, 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, 93#L693-9true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true]) [2024-11-16 23:17:43,349 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,349 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,349 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,349 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][149], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 149#L693-6true, 151#L693-6true, 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, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-16 23:17:43,353 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,353 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,353 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,353 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:17:43,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, 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|), 107#L693-9true, 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 15#L693-6true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-16 23:17:43,574 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,574 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,574 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,574 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L693-2-->L693-1: Formula: (= |v_#race~c~0_12| |v_ULTIMATE.start_thr1_#t~nondet3#1_5|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} OutVars{#race~c~0=|v_#race~c~0_12|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} AuxVars[] AssignedVars[#race~c~0][211], [114#thr1Err2ASSERT_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|), 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 7#L693-1true, 93#L693-9true, 184#true]) [2024-11-16 23:17:43,622 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,622 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,622 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,622 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L693-2-->L693-1: Formula: (= |v_#race~c~0_12| |v_ULTIMATE.start_thr1_#t~nondet3#1_5|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} OutVars{#race~c~0=|v_#race~c~0_12|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} AuxVars[] AssignedVars[#race~c~0][163], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-9true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 7#L693-1true, 184#true]) [2024-11-16 23:17:43,675 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,675 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,675 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,675 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, 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|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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, 22#L693-1true, 93#L693-9true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true]) [2024-11-16 23:17:43,708 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,708 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,708 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,708 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][223], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-16 23:17:43,723 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,723 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,723 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,723 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][176], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 10#L693-1true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true]) [2024-11-16 23:17:43,731 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,731 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,731 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:43,731 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-16 23:17:44,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L693-2-->L693-1: Formula: (= |v_#race~c~0_12| |v_ULTIMATE.start_thr1_#t~nondet3#1_5|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} OutVars{#race~c~0=|v_#race~c~0_12|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} AuxVars[] AssignedVars[#race~c~0][66], [139#L693-8true, 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|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 7#L693-1true, 184#true]) [2024-11-16 23:17:44,704 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,704 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,704 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,704 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][185], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 15#L693-6true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-16 23:17:44,709 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,710 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,710 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,710 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][71], [162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 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, 22#L693-1true, 184#true]) [2024-11-16 23:17:44,793 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,793 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,793 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,793 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][185], [162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 81#L693-6true, 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-11-16 23:17:44,797 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,797 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,798 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,798 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L693-2-->L693-1: Formula: (= |v_#race~c~0_12| |v_ULTIMATE.start_thr1_#t~nondet3#1_5|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} OutVars{#race~c~0=|v_#race~c~0_12|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} AuxVars[] AssignedVars[#race~c~0][66], [114#thr1Err2ASSERT_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|), 158#true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 7#L693-1true, 184#true]) [2024-11-16 23:17:44,828 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,828 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,828 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,828 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][185], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 179#true, 15#L693-6true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-16 23:17:44,858 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,858 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,858 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,858 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, 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|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 22#L693-1true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true]) [2024-11-16 23:17:44,931 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,931 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,931 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,931 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, 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|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 81#L693-6true, 158#true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true]) [2024-11-16 23:17:44,943 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,944 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,944 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,944 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][123], [139#L693-8true, 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|), 158#true, 10#L693-1true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true]) [2024-11-16 23:17:44,962 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,962 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,962 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,962 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][185], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-16 23:17:44,964 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,964 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,964 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:44,964 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:17:45,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][313], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 151#L693-6true, 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, 135#L693true, 93#L693-9true, 184#true]) [2024-11-16 23:17:45,159 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,159 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,159 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,160 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-10: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, 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|), 107#L693-9true, 97#L693-10true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 17#L694-3true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-16 23:17:45,234 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is not cut-off event [2024-11-16 23:17:45,234 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2024-11-16 23:17:45,234 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2024-11-16 23:17:45,235 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2024-11-16 23:17:45,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][311], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-9true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 156#true, 179#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 135#L693true, 184#true, 68#L693-7true]) [2024-11-16 23:17:45,240 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,240 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,241 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,241 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, 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|), 107#L693-9true, 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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, 135#L693true, 93#L693-9true, 184#true]) [2024-11-16 23:17:45,398 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2024-11-16 23:17:45,398 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-11-16 23:17:45,398 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-11-16 23:17:45,399 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-11-16 23:17:45,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-10: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][147], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 97#L693-10true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L694true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-16 23:17:45,634 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is not cut-off event [2024-11-16 23:17:45,634 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2024-11-16 23:17:45,634 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2024-11-16 23:17:45,634 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2024-11-16 23:17:45,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][133], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-9true, 100#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 68#L693-7true]) [2024-11-16 23:17:45,644 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,645 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,645 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,645 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][132], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 100#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|), 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 93#L693-9true, 184#true]) [2024-11-16 23:17:45,757 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,757 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,757 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:45,757 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:17:46,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][307], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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, 135#L693true, 93#L693-9true, 184#true]) [2024-11-16 23:17:46,392 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-16 23:17:46,393 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-16 23:17:46,393 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-16 23:17:46,393 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-16 23:17:46,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, 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|), 107#L693-9true, 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 17#L694-3true, 156#true, 179#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 93#L693-9true, 184#true]) [2024-11-16 23:17:46,498 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-16 23:17:46,498 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-16 23:17:46,498 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-16 23:17:46,498 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-16 23:17:46,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][306], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 43#L693-1true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 135#L693true, 184#true]) [2024-11-16 23:17:46,512 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-16 23:17:46,512 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-16 23:17:46,512 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-16 23:17:46,512 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-16 23:17:48,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693-1: Formula: (= |v_#race~c~0_3| |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_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][176], [162#true, 107#L693-9true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 10#L693-1true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L694true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-16 23:17:48,251 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-16 23:17:48,251 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:48,251 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:48,251 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:48,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693-1: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, 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|), 107#L693-9true, 43#L693-1true, 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#L694true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-16 23:17:48,252 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-16 23:17:48,252 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:48,252 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:48,252 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:17:48,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-10: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][256], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 97#L693-10true, 158#true, Black: 176#(= |#race~c~0| 0), 51#L694true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 12#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 135#L693true, 184#true]) [2024-11-16 23:17:48,573 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is not cut-off event [2024-11-16 23:17:48,573 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2024-11-16 23:17:48,573 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2024-11-16 23:17:48,573 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2024-11-16 23:17:49,905 INFO L124 PetriNetUnfolderBase]: 57949/139618 cut-off events. [2024-11-16 23:17:49,906 INFO L125 PetriNetUnfolderBase]: For 335717/355708 co-relation queries the response was YES. [2024-11-16 23:17:50,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401619 conditions, 139618 events. 57949/139618 cut-off events. For 335717/355708 co-relation queries the response was YES. Maximal size of possible extension queue 4972. Compared 1913752 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-11-16 23:17:51,102 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 112 selfloop transitions, 76 changer transitions 0/315 dead transitions. [2024-11-16 23:17:51,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 315 transitions, 2301 flow [2024-11-16 23:17:51,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:17:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:17:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2024-11-16 23:17:51,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8467908902691511 [2024-11-16 23:17:51,104 INFO L175 Difference]: Start difference. First operand has 162 places, 244 transitions, 1330 flow. Second operand 3 states and 409 transitions. [2024-11-16 23:17:51,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 315 transitions, 2301 flow [2024-11-16 23:17:53,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 315 transitions, 2097 flow, removed 46 selfloop flow, removed 2 redundant places. [2024-11-16 23:17:53,843 INFO L231 Difference]: Finished difference. Result has 164 places, 308 transitions, 2136 flow [2024-11-16 23:17:53,844 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-11-16 23:17:53,844 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, 5 predicate places. [2024-11-16 23:17:53,844 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 308 transitions, 2136 flow [2024-11-16 23:17:53,845 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-11-16 23:17:53,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:17:53,845 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-11-16 23:17:53,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 23:17:53,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-16 23:17:53,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:17:53,845 INFO L85 PathProgramCache]: Analyzing trace with hash -112725000, now seen corresponding path program 1 times [2024-11-16 23:17:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:17:53,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315366936] [2024-11-16 23:17:53,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:17:53,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:17:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:17:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:17:53,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:17:53,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315366936] [2024-11-16 23:17:53,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315366936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:17:53,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:17:53,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:17:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009837285] [2024-11-16 23:17:53,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:17:53,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:17:53,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:17:53,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:17:53,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:17:53,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2024-11-16 23:17:53,927 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-11-16 23:17:53,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:17:53,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2024-11-16 23:17:53,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand