./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/weaver/chl-file-item-trans.wvr.c -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 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:52:46,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:52:46,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:52:46,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:52:46,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:52:46,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:52:46,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:52:46,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:52:46,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:52:46,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:52:46,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:52:46,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:52:46,619 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:52:46,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:52:46,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:52:46,619 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:52:46,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:52:46,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:52:46,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:52:46,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:52:46,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:52:46,620 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:46,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:52:46,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:52:46,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:52:46,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:52:46,621 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a [2025-03-04 06:52:46,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:52:46,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:52:46,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:52:46,843 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:52:46,843 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:52:46,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-03-04 06:52:47,974 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ab71e97/00d5f2af68654774b34fecb1a93b5b5a/FLAGd3ecae5e7 [2025-03-04 06:52:48,281 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:52:48,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-03-04 06:52:48,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ab71e97/00d5f2af68654774b34fecb1a93b5b5a/FLAGd3ecae5e7 [2025-03-04 06:52:48,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ab71e97/00d5f2af68654774b34fecb1a93b5b5a [2025-03-04 06:52:48,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:52:48,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:52:48,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:52:48,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:52:48,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:52:48,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350ce49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48, skipping insertion in model container [2025-03-04 06:52:48,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:52:48,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:52:48,741 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:52:48,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:52:48,783 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:52:48,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48 WrapperNode [2025-03-04 06:52:48,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:52:48,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:52:48,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:52:48,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:52:48,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,830 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 304 [2025-03-04 06:52:48,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:52:48,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:52:48,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:52:48,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:52:48,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,847 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:52:48,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:52:48,864 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:52:48,864 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:52:48,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (1/1) ... [2025-03-04 06:52:48,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:48,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:48,890 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) [2025-03-04 06:52:48,893 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 [2025-03-04 06:52:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:52:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:52:48,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:52:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:52:48,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:52:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:52:48,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:52:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:52:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:52:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:52:48,912 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:52:48,994 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:52:48,995 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:52:49,400 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:52:49,401 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:52:49,421 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:52:49,423 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:52:49,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:49 BoogieIcfgContainer [2025-03-04 06:52:49,423 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:52:49,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:52:49,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:52:49,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:52:49,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:52:48" (1/3) ... [2025-03-04 06:52:49,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f0cd3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:52:49, skipping insertion in model container [2025-03-04 06:52:49,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:48" (2/3) ... [2025-03-04 06:52:49,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f0cd3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:52:49, skipping insertion in model container [2025-03-04 06:52:49,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:49" (3/3) ... [2025-03-04 06:52:49,432 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2025-03-04 06:52:49,443 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:52:49,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-trans.wvr.c that has 4 procedures, 383 locations, 1 initial locations, 0 loop locations, and 39 error locations. [2025-03-04 06:52:49,446 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:52:49,575 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:52:49,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 392 places, 403 transitions, 827 flow [2025-03-04 06:52:49,772 INFO L124 PetriNetUnfolderBase]: 21/400 cut-off events. [2025-03-04 06:52:49,773 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:52:49,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 400 events. 21/400 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1083 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 283. Up to 2 conditions per place. [2025-03-04 06:52:49,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 392 places, 403 transitions, 827 flow [2025-03-04 06:52:49,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 370 places, 379 transitions, 776 flow [2025-03-04 06:52:49,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:52:49,808 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;@4909361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:52:49,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-03-04 06:52:49,816 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:52:49,817 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-03-04 06:52:49,817 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:52:49,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:49,817 INFO L206 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] [2025-03-04 06:52:49,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:49,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:49,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2059093705, now seen corresponding path program 1 times [2025-03-04 06:52:49,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:49,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104310539] [2025-03-04 06:52:49,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:49,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 06:52:49,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 06:52:49,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:49,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:49,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:49,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104310539] [2025-03-04 06:52:49,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104310539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:49,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:49,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:49,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249037214] [2025-03-04 06:52:49,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:49,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:49,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:49,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:49,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2025-03-04 06:52:49,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 379 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2025-03-04 06:52:49,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:49,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2025-03-04 06:52:49,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:50,129 INFO L124 PetriNetUnfolderBase]: 26/544 cut-off events. [2025-03-04 06:52:50,130 INFO L125 PetriNetUnfolderBase]: For 16/18 co-relation queries the response was YES. [2025-03-04 06:52:50,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 544 events. 26/544 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2222 event pairs, 5 based on Foata normal form. 19/475 useless extension candidates. Maximal degree in co-relation 434. Up to 22 conditions per place. [2025-03-04 06:52:50,139 INFO L140 encePairwiseOnDemand]: 394/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-03-04 06:52:50,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 372 transitions, 788 flow [2025-03-04 06:52:50,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2025-03-04 06:52:50,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9594706368899917 [2025-03-04 06:52:50,158 INFO L175 Difference]: Start difference. First operand has 370 places, 379 transitions, 776 flow. Second operand 3 states and 1160 transitions. [2025-03-04 06:52:50,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 372 transitions, 788 flow [2025-03-04 06:52:50,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 372 transitions, 776 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:52:50,172 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 754 flow [2025-03-04 06:52:50,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2025-03-04 06:52:50,177 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -5 predicate places. [2025-03-04 06:52:50,178 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 754 flow [2025-03-04 06:52:50,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2025-03-04 06:52:50,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:50,179 INFO L206 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] [2025-03-04 06:52:50,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:52:50,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:50,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash -58694496, now seen corresponding path program 1 times [2025-03-04 06:52:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:50,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463957828] [2025-03-04 06:52:50,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:50,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 06:52:50,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 06:52:50,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:50,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463957828] [2025-03-04 06:52:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463957828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:50,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:50,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:50,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110321968] [2025-03-04 06:52:50,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:50,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:50,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:50,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:50,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:50,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2025-03-04 06:52:50,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2025-03-04 06:52:50,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:50,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2025-03-04 06:52:50,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:50,367 INFO L124 PetriNetUnfolderBase]: 36/706 cut-off events. [2025-03-04 06:52:50,367 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-04 06:52:50,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 706 events. 36/706 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3260 event pairs, 7 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 707. Up to 25 conditions per place. [2025-03-04 06:52:50,375 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-03-04 06:52:50,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 371 transitions, 778 flow [2025-03-04 06:52:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2025-03-04 06:52:50,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2025-03-04 06:52:50,379 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 754 flow. Second operand 3 states and 1154 transitions. [2025-03-04 06:52:50,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 371 transitions, 778 flow [2025-03-04 06:52:50,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 371 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:50,388 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 752 flow [2025-03-04 06:52:50,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2025-03-04 06:52:50,389 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -6 predicate places. [2025-03-04 06:52:50,389 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 752 flow [2025-03-04 06:52:50,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2025-03-04 06:52:50,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:50,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:50,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:52:50,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:50,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:50,391 INFO L85 PathProgramCache]: Analyzing trace with hash -68150219, now seen corresponding path program 1 times [2025-03-04 06:52:50,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:50,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192471879] [2025-03-04 06:52:50,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:50,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:50,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 06:52:50,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 06:52:50,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:50,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:50,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:50,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192471879] [2025-03-04 06:52:50,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192471879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:50,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:50,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:50,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604642208] [2025-03-04 06:52:50,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:50,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:50,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:50,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:50,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:50,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2025-03-04 06:52:50,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2025-03-04 06:52:50,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:50,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2025-03-04 06:52:50,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:50,564 INFO L124 PetriNetUnfolderBase]: 24/462 cut-off events. [2025-03-04 06:52:50,564 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-04 06:52:50,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 462 events. 24/462 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1669 event pairs, 7 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 452. Up to 25 conditions per place. [2025-03-04 06:52:50,569 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-03-04 06:52:50,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 370 transitions, 776 flow [2025-03-04 06:52:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2025-03-04 06:52:50,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2025-03-04 06:52:50,573 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 752 flow. Second operand 3 states and 1154 transitions. [2025-03-04 06:52:50,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 370 transitions, 776 flow [2025-03-04 06:52:50,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 370 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:50,578 INFO L231 Difference]: Finished difference. Result has 363 places, 370 transitions, 750 flow [2025-03-04 06:52:50,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=363, PETRI_TRANSITIONS=370} [2025-03-04 06:52:50,579 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -7 predicate places. [2025-03-04 06:52:50,579 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 370 transitions, 750 flow [2025-03-04 06:52:50,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2025-03-04 06:52:50,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:50,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:50,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:52:50,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:50,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2074920537, now seen corresponding path program 1 times [2025-03-04 06:52:50,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:50,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493470203] [2025-03-04 06:52:50,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:50,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 06:52:50,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 06:52:50,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:50,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:50,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:50,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493470203] [2025-03-04 06:52:50,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493470203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:50,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:50,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980399104] [2025-03-04 06:52:50,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:50,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:50,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:50,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:50,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:50,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2025-03-04 06:52:50,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 370 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2025-03-04 06:52:50,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:50,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2025-03-04 06:52:50,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:50,755 INFO L124 PetriNetUnfolderBase]: 30/607 cut-off events. [2025-03-04 06:52:50,755 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:52:50,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 607 events. 30/607 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2846 event pairs, 5 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 587. Up to 22 conditions per place. [2025-03-04 06:52:50,762 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-03-04 06:52:50,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 369 transitions, 774 flow [2025-03-04 06:52:50,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2025-03-04 06:52:50,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2025-03-04 06:52:50,765 INFO L175 Difference]: Start difference. First operand has 363 places, 370 transitions, 750 flow. Second operand 3 states and 1154 transitions. [2025-03-04 06:52:50,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 369 transitions, 774 flow [2025-03-04 06:52:50,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 369 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:50,769 INFO L231 Difference]: Finished difference. Result has 362 places, 369 transitions, 748 flow [2025-03-04 06:52:50,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=362, PETRI_TRANSITIONS=369} [2025-03-04 06:52:50,770 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -8 predicate places. [2025-03-04 06:52:50,770 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 369 transitions, 748 flow [2025-03-04 06:52:50,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2025-03-04 06:52:50,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:50,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:50,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:52:50,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:50,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:50,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1586665025, now seen corresponding path program 1 times [2025-03-04 06:52:50,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:50,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139903192] [2025-03-04 06:52:50,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:50,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:50,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:52:50,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:52:50,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:50,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:50,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:50,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139903192] [2025-03-04 06:52:50,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139903192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:50,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:50,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:50,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86321855] [2025-03-04 06:52:50,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:50,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:50,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:50,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:50,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2025-03-04 06:52:50,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 369 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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) [2025-03-04 06:52:50,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:50,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2025-03-04 06:52:50,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:50,936 INFO L124 PetriNetUnfolderBase]: 53/904 cut-off events. [2025-03-04 06:52:50,936 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:52:50,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 904 events. 53/904 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5217 event pairs, 12 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 894. Up to 35 conditions per place. [2025-03-04 06:52:50,961 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 12 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-03-04 06:52:50,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 368 transitions, 774 flow [2025-03-04 06:52:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2025-03-04 06:52:50,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2025-03-04 06:52:50,963 INFO L175 Difference]: Start difference. First operand has 362 places, 369 transitions, 748 flow. Second operand 3 states and 1152 transitions. [2025-03-04 06:52:50,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 368 transitions, 774 flow [2025-03-04 06:52:50,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 368 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:50,968 INFO L231 Difference]: Finished difference. Result has 361 places, 368 transitions, 746 flow [2025-03-04 06:52:50,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=361, PETRI_TRANSITIONS=368} [2025-03-04 06:52:50,972 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -9 predicate places. [2025-03-04 06:52:50,973 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 368 transitions, 746 flow [2025-03-04 06:52:50,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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) [2025-03-04 06:52:50,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:50,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:50,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:52:50,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:50,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:50,976 INFO L85 PathProgramCache]: Analyzing trace with hash 421859963, now seen corresponding path program 1 times [2025-03-04 06:52:50,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:50,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257927838] [2025-03-04 06:52:50,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:50,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:50,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:52:50,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:52:50,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:50,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:51,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:51,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257927838] [2025-03-04 06:52:51,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257927838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:51,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:51,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:51,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897309505] [2025-03-04 06:52:51,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:51,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:51,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:51,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:51,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 403 [2025-03-04 06:52:51,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 368 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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) [2025-03-04 06:52:51,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:51,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 403 [2025-03-04 06:52:51,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:51,173 INFO L124 PetriNetUnfolderBase]: 65/963 cut-off events. [2025-03-04 06:52:51,174 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-03-04 06:52:51,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 963 events. 65/963 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5222 event pairs, 20 based on Foata normal form. 0/802 useless extension candidates. Maximal degree in co-relation 955. Up to 50 conditions per place. [2025-03-04 06:52:51,183 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-03-04 06:52:51,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 367 transitions, 774 flow [2025-03-04 06:52:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2025-03-04 06:52:51,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511993382961125 [2025-03-04 06:52:51,187 INFO L175 Difference]: Start difference. First operand has 361 places, 368 transitions, 746 flow. Second operand 3 states and 1150 transitions. [2025-03-04 06:52:51,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 367 transitions, 774 flow [2025-03-04 06:52:51,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 367 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:51,193 INFO L231 Difference]: Finished difference. Result has 360 places, 367 transitions, 744 flow [2025-03-04 06:52:51,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=360, PETRI_TRANSITIONS=367} [2025-03-04 06:52:51,195 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -10 predicate places. [2025-03-04 06:52:51,195 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 367 transitions, 744 flow [2025-03-04 06:52:51,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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) [2025-03-04 06:52:51,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:51,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:51,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:52:51,196 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:51,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:51,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1280669128, now seen corresponding path program 1 times [2025-03-04 06:52:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:51,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932324112] [2025-03-04 06:52:51,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:51,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:51,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 06:52:51,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:52:51,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:51,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:51,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:51,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932324112] [2025-03-04 06:52:51,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932324112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:51,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:51,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733239791] [2025-03-04 06:52:51,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:51,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:51,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:51,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:51,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:51,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2025-03-04 06:52:51,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 367 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2025-03-04 06:52:51,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:51,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2025-03-04 06:52:51,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:51,376 INFO L124 PetriNetUnfolderBase]: 31/661 cut-off events. [2025-03-04 06:52:51,377 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-04 06:52:51,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 661 events. 31/661 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2846 event pairs, 5 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 618. Up to 23 conditions per place. [2025-03-04 06:52:51,385 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2025-03-04 06:52:51,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 366 transitions, 768 flow [2025-03-04 06:52:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2025-03-04 06:52:51,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2025-03-04 06:52:51,389 INFO L175 Difference]: Start difference. First operand has 360 places, 367 transitions, 744 flow. Second operand 3 states and 1154 transitions. [2025-03-04 06:52:51,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 366 transitions, 768 flow [2025-03-04 06:52:51,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 366 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:51,394 INFO L231 Difference]: Finished difference. Result has 359 places, 366 transitions, 742 flow [2025-03-04 06:52:51,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=359, PETRI_TRANSITIONS=366} [2025-03-04 06:52:51,396 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -11 predicate places. [2025-03-04 06:52:51,396 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 366 transitions, 742 flow [2025-03-04 06:52:51,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2025-03-04 06:52:51,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:51,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:51,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:52:51,397 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:51,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2089512990, now seen corresponding path program 1 times [2025-03-04 06:52:51,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:51,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842603899] [2025-03-04 06:52:51,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:51,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:51,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:52:51,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:52:51,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:51,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:51,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:51,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842603899] [2025-03-04 06:52:51,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842603899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:51,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:51,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:51,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392972071] [2025-03-04 06:52:51,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:51,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:51,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:51,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:51,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:51,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2025-03-04 06:52:51,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 366 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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) [2025-03-04 06:52:51,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:51,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2025-03-04 06:52:51,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:51,552 INFO L124 PetriNetUnfolderBase]: 53/951 cut-off events. [2025-03-04 06:52:51,552 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-03-04 06:52:51,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 951 events. 53/951 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5704 event pairs, 12 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 917. Up to 35 conditions per place. [2025-03-04 06:52:51,560 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 12 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2025-03-04 06:52:51,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 365 transitions, 768 flow [2025-03-04 06:52:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2025-03-04 06:52:51,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2025-03-04 06:52:51,562 INFO L175 Difference]: Start difference. First operand has 359 places, 366 transitions, 742 flow. Second operand 3 states and 1152 transitions. [2025-03-04 06:52:51,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 365 transitions, 768 flow [2025-03-04 06:52:51,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 365 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:51,566 INFO L231 Difference]: Finished difference. Result has 358 places, 365 transitions, 740 flow [2025-03-04 06:52:51,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=358, PETRI_TRANSITIONS=365} [2025-03-04 06:52:51,567 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -12 predicate places. [2025-03-04 06:52:51,567 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 365 transitions, 740 flow [2025-03-04 06:52:51,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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) [2025-03-04 06:52:51,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:51,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:51,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:52:51,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:51,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:51,569 INFO L85 PathProgramCache]: Analyzing trace with hash 331361119, now seen corresponding path program 1 times [2025-03-04 06:52:51,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:51,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113835857] [2025-03-04 06:52:51,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:51,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:51,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:52:51,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:52:51,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:51,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:51,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:51,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113835857] [2025-03-04 06:52:51,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113835857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:51,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:51,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169403709] [2025-03-04 06:52:51,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:51,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:51,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:51,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:51,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:51,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 403 [2025-03-04 06:52:51,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 365 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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) [2025-03-04 06:52:51,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:51,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 403 [2025-03-04 06:52:51,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:51,666 INFO L124 PetriNetUnfolderBase]: 41/556 cut-off events. [2025-03-04 06:52:51,666 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2025-03-04 06:52:51,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 556 events. 41/556 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2624 event pairs, 20 based on Foata normal form. 0/476 useless extension candidates. Maximal degree in co-relation 524. Up to 50 conditions per place. [2025-03-04 06:52:51,671 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2025-03-04 06:52:51,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 364 transitions, 768 flow [2025-03-04 06:52:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2025-03-04 06:52:51,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511993382961125 [2025-03-04 06:52:51,674 INFO L175 Difference]: Start difference. First operand has 358 places, 365 transitions, 740 flow. Second operand 3 states and 1150 transitions. [2025-03-04 06:52:51,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 364 transitions, 768 flow [2025-03-04 06:52:51,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:51,677 INFO L231 Difference]: Finished difference. Result has 357 places, 364 transitions, 738 flow [2025-03-04 06:52:51,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=357, PETRI_TRANSITIONS=364} [2025-03-04 06:52:51,678 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2025-03-04 06:52:51,678 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 364 transitions, 738 flow [2025-03-04 06:52:51,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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) [2025-03-04 06:52:51,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:51,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:51,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:52:51,679 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:51,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:51,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1498958330, now seen corresponding path program 1 times [2025-03-04 06:52:51,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:51,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-04 06:52:51,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:51,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:51,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 06:52:51,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 06:52:51,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:51,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-04 06:52:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465913524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:51,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:51,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894331538] [2025-03-04 06:52:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:51,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:51,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:51,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:51,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:51,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2025-03-04 06:52:51,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 364 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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) [2025-03-04 06:52:51,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:51,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2025-03-04 06:52:51,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:51,823 INFO L124 PetriNetUnfolderBase]: 53/916 cut-off events. [2025-03-04 06:52:51,823 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:52:51,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 916 events. 53/916 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5430 event pairs, 8 based on Foata normal form. 0/767 useless extension candidates. Maximal degree in co-relation 862. Up to 31 conditions per place. [2025-03-04 06:52:51,833 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2025-03-04 06:52:51,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 366 transitions, 774 flow [2025-03-04 06:52:51,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-03-04 06:52:51,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2025-03-04 06:52:51,836 INFO L175 Difference]: Start difference. First operand has 357 places, 364 transitions, 738 flow. Second operand 3 states and 1163 transitions. [2025-03-04 06:52:51,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 366 transitions, 774 flow [2025-03-04 06:52:51,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 366 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:51,840 INFO L231 Difference]: Finished difference. Result has 356 places, 364 transitions, 744 flow [2025-03-04 06:52:51,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=356, PETRI_TRANSITIONS=364} [2025-03-04 06:52:51,841 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-03-04 06:52:51,841 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 364 transitions, 744 flow [2025-03-04 06:52:51,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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) [2025-03-04 06:52:51,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:51,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:51,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:52:51,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:51,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash 693406132, now seen corresponding path program 1 times [2025-03-04 06:52:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158149460] [2025-03-04 06:52:51,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:51,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:51,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 06:52:51,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 06:52:51,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:51,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:51,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158149460] [2025-03-04 06:52:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158149460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:51,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:51,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:51,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131955789] [2025-03-04 06:52:51,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:51,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:51,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:51,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:51,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:51,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2025-03-04 06:52:51,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 364 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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) [2025-03-04 06:52:51,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:51,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2025-03-04 06:52:51,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:52,077 INFO L124 PetriNetUnfolderBase]: 119/1736 cut-off events. [2025-03-04 06:52:52,077 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:52:52,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1736 events. 119/1736 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 14260 event pairs, 23 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 1582. Up to 73 conditions per place. [2025-03-04 06:52:52,099 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 15 selfloop transitions, 3 changer transitions 0/366 dead transitions. [2025-03-04 06:52:52,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 366 transitions, 786 flow [2025-03-04 06:52:52,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1158 transitions. [2025-03-04 06:52:52,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578163771712159 [2025-03-04 06:52:52,102 INFO L175 Difference]: Start difference. First operand has 356 places, 364 transitions, 744 flow. Second operand 3 states and 1158 transitions. [2025-03-04 06:52:52,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 366 transitions, 786 flow [2025-03-04 06:52:52,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 366 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:52,106 INFO L231 Difference]: Finished difference. Result has 356 places, 364 transitions, 759 flow [2025-03-04 06:52:52,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=356, PETRI_TRANSITIONS=364} [2025-03-04 06:52:52,108 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-03-04 06:52:52,108 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 364 transitions, 759 flow [2025-03-04 06:52:52,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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) [2025-03-04 06:52:52,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:52,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:52,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:52:52,109 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:52,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1529832765, now seen corresponding path program 1 times [2025-03-04 06:52:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:52,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058799137] [2025-03-04 06:52:52,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:52,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:52:52,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:52:52,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:52,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058799137] [2025-03-04 06:52:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058799137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632693049] [2025-03-04 06:52:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:52,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:52,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:52,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:52,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:52,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2025-03-04 06:52:52,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 364 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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) [2025-03-04 06:52:52,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:52,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2025-03-04 06:52:52,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:52,333 INFO L124 PetriNetUnfolderBase]: 57/1088 cut-off events. [2025-03-04 06:52:52,334 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-03-04 06:52:52,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 1088 events. 57/1088 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6856 event pairs, 2 based on Foata normal form. 0/933 useless extension candidates. Maximal degree in co-relation 955. Up to 38 conditions per place. [2025-03-04 06:52:52,348 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-03-04 06:52:52,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 369 transitions, 810 flow [2025-03-04 06:52:52,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2025-03-04 06:52:52,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2025-03-04 06:52:52,352 INFO L175 Difference]: Start difference. First operand has 356 places, 364 transitions, 759 flow. Second operand 3 states and 1166 transitions. [2025-03-04 06:52:52,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 369 transitions, 810 flow [2025-03-04 06:52:52,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 369 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:52,357 INFO L231 Difference]: Finished difference. Result has 357 places, 364 transitions, 769 flow [2025-03-04 06:52:52,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=357, PETRI_TRANSITIONS=364} [2025-03-04 06:52:52,358 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2025-03-04 06:52:52,359 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 364 transitions, 769 flow [2025-03-04 06:52:52,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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) [2025-03-04 06:52:52,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:52,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:52,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:52:52,361 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:52,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:52,361 INFO L85 PathProgramCache]: Analyzing trace with hash 315039974, now seen corresponding path program 1 times [2025-03-04 06:52:52,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:52,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908744898] [2025-03-04 06:52:52,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:52,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:52,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:52:52,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:52:52,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:52,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:52,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:52,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908744898] [2025-03-04 06:52:52,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908744898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:52,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:52,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:52,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495780625] [2025-03-04 06:52:52,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:52,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:52,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:52,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:52,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:52,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2025-03-04 06:52:52,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 364 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 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) [2025-03-04 06:52:52,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:52,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2025-03-04 06:52:52,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:52,523 INFO L124 PetriNetUnfolderBase]: 59/1040 cut-off events. [2025-03-04 06:52:52,524 INFO L125 PetriNetUnfolderBase]: For 4/20 co-relation queries the response was YES. [2025-03-04 06:52:52,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 1040 events. 59/1040 cut-off events. For 4/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6828 event pairs, 8 based on Foata normal form. 2/895 useless extension candidates. Maximal degree in co-relation 941. Up to 32 conditions per place. [2025-03-04 06:52:52,550 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2025-03-04 06:52:52,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 365 transitions, 799 flow [2025-03-04 06:52:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-03-04 06:52:52,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2025-03-04 06:52:52,553 INFO L175 Difference]: Start difference. First operand has 357 places, 364 transitions, 769 flow. Second operand 3 states and 1163 transitions. [2025-03-04 06:52:52,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 365 transitions, 799 flow [2025-03-04 06:52:52,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 365 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:52,557 INFO L231 Difference]: Finished difference. Result has 358 places, 363 transitions, 771 flow [2025-03-04 06:52:52,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=358, PETRI_TRANSITIONS=363} [2025-03-04 06:52:52,559 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -12 predicate places. [2025-03-04 06:52:52,559 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 363 transitions, 771 flow [2025-03-04 06:52:52,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 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) [2025-03-04 06:52:52,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:52,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:52,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:52:52,560 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:52,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:52,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1349131713, now seen corresponding path program 1 times [2025-03-04 06:52:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:52,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-04 06:52:52,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:52,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 06:52:52,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 06:52:52,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:52,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:52,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:52,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-04 06:52:52,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186422006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:52,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:52,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505633170] [2025-03-04 06:52:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:52,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:52,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:52,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:52,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:52,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2025-03-04 06:52:52,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 363 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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) [2025-03-04 06:52:52,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:52,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2025-03-04 06:52:52,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:52,791 INFO L124 PetriNetUnfolderBase]: 105/1770 cut-off events. [2025-03-04 06:52:52,791 INFO L125 PetriNetUnfolderBase]: For 8/11 co-relation queries the response was YES. [2025-03-04 06:52:52,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 1770 events. 105/1770 cut-off events. For 8/11 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 14405 event pairs, 10 based on Foata normal form. 1/1526 useless extension candidates. Maximal degree in co-relation 1730. Up to 94 conditions per place. [2025-03-04 06:52:52,812 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 18 selfloop transitions, 3 changer transitions 0/368 dead transitions. [2025-03-04 06:52:52,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 368 transitions, 828 flow [2025-03-04 06:52:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1161 transitions. [2025-03-04 06:52:52,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9602977667493796 [2025-03-04 06:52:52,814 INFO L175 Difference]: Start difference. First operand has 358 places, 363 transitions, 771 flow. Second operand 3 states and 1161 transitions. [2025-03-04 06:52:52,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 368 transitions, 828 flow [2025-03-04 06:52:52,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 368 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:52,852 INFO L231 Difference]: Finished difference. Result has 356 places, 363 transitions, 782 flow [2025-03-04 06:52:52,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=356, PETRI_TRANSITIONS=363} [2025-03-04 06:52:52,854 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-03-04 06:52:52,854 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 363 transitions, 782 flow [2025-03-04 06:52:52,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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) [2025-03-04 06:52:52,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:52,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:52,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:52:52,856 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:52,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1028426771, now seen corresponding path program 1 times [2025-03-04 06:52:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:52,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029733940] [2025-03-04 06:52:52,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:52,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:52,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 06:52:52,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 06:52:52,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:52,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:52,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:52,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029733940] [2025-03-04 06:52:52,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029733940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:52,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:52,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:52,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685290719] [2025-03-04 06:52:52,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:52,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:52,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:52,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:52,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:52,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2025-03-04 06:52:52,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 363 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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) [2025-03-04 06:52:52,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:52,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2025-03-04 06:52:52,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:53,353 INFO L124 PetriNetUnfolderBase]: 364/4972 cut-off events. [2025-03-04 06:52:53,354 INFO L125 PetriNetUnfolderBase]: For 69/81 co-relation queries the response was YES. [2025-03-04 06:52:53,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5465 conditions, 4972 events. 364/4972 cut-off events. For 69/81 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 55976 event pairs, 100 based on Foata normal form. 0/4274 useless extension candidates. Maximal degree in co-relation 4706. Up to 331 conditions per place. [2025-03-04 06:52:53,381 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 17 selfloop transitions, 4 changer transitions 0/365 dead transitions. [2025-03-04 06:52:53,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 365 transitions, 830 flow [2025-03-04 06:52:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1153 transitions. [2025-03-04 06:52:53,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536807278742763 [2025-03-04 06:52:53,384 INFO L175 Difference]: Start difference. First operand has 356 places, 363 transitions, 782 flow. Second operand 3 states and 1153 transitions. [2025-03-04 06:52:53,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 365 transitions, 830 flow [2025-03-04 06:52:53,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 365 transitions, 830 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:53,390 INFO L231 Difference]: Finished difference. Result has 355 places, 363 transitions, 802 flow [2025-03-04 06:52:53,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=355, PETRI_TRANSITIONS=363} [2025-03-04 06:52:53,390 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2025-03-04 06:52:53,390 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 363 transitions, 802 flow [2025-03-04 06:52:53,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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) [2025-03-04 06:52:53,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:53,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:53,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:52:53,392 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:53,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash 321899439, now seen corresponding path program 1 times [2025-03-04 06:52:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336477705] [2025-03-04 06:52:53,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:53,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:53,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:52:53,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:52:53,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:53,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:53,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:53,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336477705] [2025-03-04 06:52:53,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336477705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:53,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:53,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:53,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342516191] [2025-03-04 06:52:53,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:53,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:53,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:53,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:53,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:53,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2025-03-04 06:52:53,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 363 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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) [2025-03-04 06:52:53,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:53,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2025-03-04 06:52:53,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:53,838 INFO L124 PetriNetUnfolderBase]: 121/2849 cut-off events. [2025-03-04 06:52:53,838 INFO L125 PetriNetUnfolderBase]: For 33/45 co-relation queries the response was YES. [2025-03-04 06:52:53,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 2849 events. 121/2849 cut-off events. For 33/45 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 25423 event pairs, 6 based on Foata normal form. 2/2521 useless extension candidates. Maximal degree in co-relation 2660. Up to 114 conditions per place. [2025-03-04 06:52:53,872 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-03-04 06:52:53,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 368 transitions, 853 flow [2025-03-04 06:52:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2025-03-04 06:52:53,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2025-03-04 06:52:53,875 INFO L175 Difference]: Start difference. First operand has 355 places, 363 transitions, 802 flow. Second operand 3 states and 1166 transitions. [2025-03-04 06:52:53,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 368 transitions, 853 flow [2025-03-04 06:52:53,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 368 transitions, 853 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:53,880 INFO L231 Difference]: Finished difference. Result has 356 places, 363 transitions, 812 flow [2025-03-04 06:52:53,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=356, PETRI_TRANSITIONS=363} [2025-03-04 06:52:53,881 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-03-04 06:52:53,881 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 363 transitions, 812 flow [2025-03-04 06:52:53,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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) [2025-03-04 06:52:53,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:53,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:53,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:52:53,882 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:53,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:53,883 INFO L85 PathProgramCache]: Analyzing trace with hash 107741841, now seen corresponding path program 1 times [2025-03-04 06:52:53,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:53,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215496738] [2025-03-04 06:52:53,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:53,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:53,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:52:53,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:52:53,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:53,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:53,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215496738] [2025-03-04 06:52:53,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215496738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:53,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:53,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989028493] [2025-03-04 06:52:53,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:53,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:53,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:53,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:53,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2025-03-04 06:52:53,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 363 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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) [2025-03-04 06:52:53,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:53,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2025-03-04 06:52:53,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:54,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1050] thread3EXIT-->L82-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][367], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 426#true, 119#L82-16true, Black: 430#true, 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:54,266 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-04 06:52:54,266 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-03-04 06:52:54,266 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 06:52:54,266 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 06:52:54,268 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1050] thread3EXIT-->L82-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][367], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 426#true, 119#L82-16true, Black: 430#true, 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:54,268 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2025-03-04 06:52:54,268 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2025-03-04 06:52:54,268 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-04 06:52:54,268 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-04 06:52:54,268 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-04 06:52:54,275 INFO L124 PetriNetUnfolderBase]: 113/2955 cut-off events. [2025-03-04 06:52:54,275 INFO L125 PetriNetUnfolderBase]: For 17/35 co-relation queries the response was YES. [2025-03-04 06:52:54,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3234 conditions, 2955 events. 113/2955 cut-off events. For 17/35 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 27044 event pairs, 6 based on Foata normal form. 1/2619 useless extension candidates. Maximal degree in co-relation 2790. Up to 87 conditions per place. [2025-03-04 06:52:54,309 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-03-04 06:52:54,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 368 transitions, 863 flow [2025-03-04 06:52:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2025-03-04 06:52:54,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2025-03-04 06:52:54,312 INFO L175 Difference]: Start difference. First operand has 356 places, 363 transitions, 812 flow. Second operand 3 states and 1166 transitions. [2025-03-04 06:52:54,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 368 transitions, 863 flow [2025-03-04 06:52:54,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 368 transitions, 863 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:54,316 INFO L231 Difference]: Finished difference. Result has 357 places, 363 transitions, 822 flow [2025-03-04 06:52:54,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=357, PETRI_TRANSITIONS=363} [2025-03-04 06:52:54,316 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2025-03-04 06:52:54,316 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 363 transitions, 822 flow [2025-03-04 06:52:54,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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) [2025-03-04 06:52:54,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:54,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:54,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:52:54,318 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:54,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash -903238089, now seen corresponding path program 1 times [2025-03-04 06:52:54,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:54,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30189171] [2025-03-04 06:52:54,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:54,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:54,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:52:54,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:52:54,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:54,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:54,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:54,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30189171] [2025-03-04 06:52:54,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30189171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:54,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:54,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:54,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329699193] [2025-03-04 06:52:54,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:54,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:54,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:54,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:54,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:54,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2025-03-04 06:52:54,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 363 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 384.6666666666667) internal successors, (1154), 3 states have internal predecessors, (1154), 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) [2025-03-04 06:52:54,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:54,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2025-03-04 06:52:54,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:54,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1050] thread3EXIT-->L82-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][349], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 426#true, 119#L82-16true, Black: 430#true, 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0), 453#true]) [2025-03-04 06:52:54,807 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-04 06:52:54,807 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-03-04 06:52:54,807 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-04 06:52:54,807 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 06:52:54,810 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1050] thread3EXIT-->L82-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][349], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 426#true, 119#L82-16true, Black: 430#true, 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 453#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:54,811 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-04 06:52:54,811 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-03-04 06:52:54,811 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-04 06:52:54,811 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 06:52:54,811 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 06:52:54,811 INFO L124 PetriNetUnfolderBase]: 226/4571 cut-off events. [2025-03-04 06:52:54,812 INFO L125 PetriNetUnfolderBase]: For 51/156 co-relation queries the response was YES. [2025-03-04 06:52:54,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5203 conditions, 4571 events. 226/4571 cut-off events. For 51/156 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 46277 event pairs, 40 based on Foata normal form. 7/4063 useless extension candidates. Maximal degree in co-relation 4423. Up to 156 conditions per place. [2025-03-04 06:52:54,859 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2025-03-04 06:52:54,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 364 transitions, 852 flow [2025-03-04 06:52:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-03-04 06:52:54,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2025-03-04 06:52:54,862 INFO L175 Difference]: Start difference. First operand has 357 places, 363 transitions, 822 flow. Second operand 3 states and 1163 transitions. [2025-03-04 06:52:54,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 364 transitions, 852 flow [2025-03-04 06:52:54,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 364 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:54,866 INFO L231 Difference]: Finished difference. Result has 358 places, 362 transitions, 824 flow [2025-03-04 06:52:54,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=358, PETRI_TRANSITIONS=362} [2025-03-04 06:52:54,867 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -12 predicate places. [2025-03-04 06:52:54,867 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 362 transitions, 824 flow [2025-03-04 06:52:54,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.6666666666667) internal successors, (1154), 3 states have internal predecessors, (1154), 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) [2025-03-04 06:52:54,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:54,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:54,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:52:54,868 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:54,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:54,869 INFO L85 PathProgramCache]: Analyzing trace with hash -461045922, now seen corresponding path program 1 times [2025-03-04 06:52:54,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:54,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406560860] [2025-03-04 06:52:54,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:54,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:54,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 06:52:54,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 06:52:54,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:54,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406560860] [2025-03-04 06:52:54,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406560860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:54,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:54,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:54,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751825254] [2025-03-04 06:52:54,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:54,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:54,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:54,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:54,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2025-03-04 06:52:54,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 362 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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) [2025-03-04 06:52:54,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:54,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2025-03-04 06:52:54,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:55,720 INFO L124 PetriNetUnfolderBase]: 473/7671 cut-off events. [2025-03-04 06:52:55,720 INFO L125 PetriNetUnfolderBase]: For 134/144 co-relation queries the response was YES. [2025-03-04 06:52:55,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8778 conditions, 7671 events. 473/7671 cut-off events. For 134/144 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 91617 event pairs, 76 based on Foata normal form. 0/6925 useless extension candidates. Maximal degree in co-relation 7850. Up to 624 conditions per place. [2025-03-04 06:52:55,775 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 19 selfloop transitions, 4 changer transitions 0/366 dead transitions. [2025-03-04 06:52:55,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 366 transitions, 882 flow [2025-03-04 06:52:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2025-03-04 06:52:55,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9553349875930521 [2025-03-04 06:52:55,778 INFO L175 Difference]: Start difference. First operand has 358 places, 362 transitions, 824 flow. Second operand 3 states and 1155 transitions. [2025-03-04 06:52:55,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 366 transitions, 882 flow [2025-03-04 06:52:55,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 366 transitions, 878 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:55,787 INFO L231 Difference]: Finished difference. Result has 355 places, 362 transitions, 840 flow [2025-03-04 06:52:55,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=355, PETRI_TRANSITIONS=362} [2025-03-04 06:52:55,787 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2025-03-04 06:52:55,788 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 362 transitions, 840 flow [2025-03-04 06:52:55,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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) [2025-03-04 06:52:55,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:55,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:55,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:52:55,788 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:55,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1435332179, now seen corresponding path program 1 times [2025-03-04 06:52:55,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:55,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124233364] [2025-03-04 06:52:55,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:55,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:55,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:52:55,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:52:55,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:55,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:55,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124233364] [2025-03-04 06:52:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124233364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:55,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069955635] [2025-03-04 06:52:55,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:55,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:55,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:55,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:55,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:55,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2025-03-04 06:52:55,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 362 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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) [2025-03-04 06:52:55,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:55,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2025-03-04 06:52:55,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:56,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([982] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][226], [424#(= |#race~isNull_0~0| 0), 114#L80true, 428#(= |#race~isNull_3~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 211#L56-7true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 449#true, 445#true, Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,280 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-03-04 06:52:56,280 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-03-04 06:52:56,280 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-03-04 06:52:56,280 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-03-04 06:52:56,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 460#true, 211#L56-7true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,317 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-03-04 06:52:56,317 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,317 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:52:56,318 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,318 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 460#true, 211#L56-7true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,318 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-04 06:52:56,318 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,318 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:52:56,318 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,318 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:56,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([982] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][226], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 211#L56-7true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,319 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-04 06:52:56,319 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,319 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:52:56,319 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,319 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([982] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][226], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 211#L56-7true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,319 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-03-04 06:52:56,319 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-04 06:52:56,319 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,319 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:52:56,319 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,320 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([982] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][226], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 211#L56-7true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,320 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-03-04 06:52:56,320 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-04 06:52:56,320 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:52:56,320 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,320 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:52:56,320 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,321 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([982] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][226], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 211#L56-7true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,321 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-03-04 06:52:56,321 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-04 06:52:56,321 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:52:56,321 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:56,321 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,321 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:52:56,321 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:56,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), 447#(= |#race~filename_1~0| 0), Black: 422#true, 148#L56-5true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,322 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-04 06:52:56,322 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:56,322 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-03-04 06:52:56,322 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:56,323 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, 462#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 148#L56-5true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,323 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-04 06:52:56,323 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:56,323 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-03-04 06:52:56,323 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:56,323 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:56,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, 462#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 214#L56-6true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,324 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2025-03-04 06:52:56,324 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-04 06:52:56,324 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:52:56,325 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:52:56,325 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, 462#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 214#L56-6true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,325 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2025-03-04 06:52:56,325 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-04 06:52:56,325 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:52:56,325 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-03-04 06:52:56,325 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:52:56,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 161#L58true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,329 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-03-04 06:52:56,329 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:56,329 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-04 06:52:56,329 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:56,329 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 161#L58true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,329 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2025-03-04 06:52:56,329 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:56,329 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-04 06:52:56,329 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-04 06:52:56,329 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:56,330 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 460#true, 211#L56-7true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,330 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is not cut-off event [2025-03-04 06:52:56,330 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2025-03-04 06:52:56,330 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-03-04 06:52:56,330 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2025-03-04 06:52:56,330 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-04 06:52:56,330 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-03-04 06:52:56,330 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, 462#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 148#L56-5true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,330 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2025-03-04 06:52:56,330 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:56,331 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-04 06:52:56,331 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-03-04 06:52:56,331 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:56,331 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:56,332 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, 462#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 214#L56-6true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,332 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:52:56,332 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-04 06:52:56,332 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:52:56,332 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-03-04 06:52:56,332 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:52:56,332 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2025-03-04 06:52:56,335 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, 161#L58true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,335 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is not cut-off event [2025-03-04 06:52:56,335 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-04 06:52:56,336 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-03-04 06:52:56,336 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2025-03-04 06:52:56,336 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is not cut-off event [2025-03-04 06:52:56,336 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-04 06:52:56,340 INFO L124 PetriNetUnfolderBase]: 375/3955 cut-off events. [2025-03-04 06:52:56,340 INFO L125 PetriNetUnfolderBase]: For 240/323 co-relation queries the response was YES. [2025-03-04 06:52:56,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5021 conditions, 3955 events. 375/3955 cut-off events. For 240/323 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 40818 event pairs, 82 based on Foata normal form. 3/3591 useless extension candidates. Maximal degree in co-relation 4375. Up to 398 conditions per place. [2025-03-04 06:52:56,365 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2025-03-04 06:52:56,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 363 transitions, 870 flow [2025-03-04 06:52:56,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-03-04 06:52:56,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2025-03-04 06:52:56,367 INFO L175 Difference]: Start difference. First operand has 355 places, 362 transitions, 840 flow. Second operand 3 states and 1163 transitions. [2025-03-04 06:52:56,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 363 transitions, 870 flow [2025-03-04 06:52:56,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 363 transitions, 870 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:56,371 INFO L231 Difference]: Finished difference. Result has 356 places, 361 transitions, 842 flow [2025-03-04 06:52:56,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=356, PETRI_TRANSITIONS=361} [2025-03-04 06:52:56,372 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-03-04 06:52:56,372 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 361 transitions, 842 flow [2025-03-04 06:52:56,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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) [2025-03-04 06:52:56,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:56,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:56,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:52:56,373 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:56,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1155149090, now seen corresponding path program 1 times [2025-03-04 06:52:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:56,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729027045] [2025-03-04 06:52:56,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:56,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:52:56,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:52:56,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:56,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:56,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:56,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729027045] [2025-03-04 06:52:56,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729027045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:56,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:56,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:56,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510398535] [2025-03-04 06:52:56,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:56,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:56,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:56,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:56,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:56,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2025-03-04 06:52:56,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 361 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 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) [2025-03-04 06:52:56,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:56,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2025-03-04 06:52:56,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:56,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1050] thread3EXIT-->L82-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][348], [424#(= |#race~isNull_0~0| 0), 463#true, 428#(= |#race~isNull_3~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 119#L82-16true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 449#true, 445#true, Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:56,855 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2025-03-04 06:52:56,855 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-03-04 06:52:56,855 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2025-03-04 06:52:56,855 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-03-04 06:52:56,901 INFO L124 PetriNetUnfolderBase]: 252/5660 cut-off events. [2025-03-04 06:52:56,901 INFO L125 PetriNetUnfolderBase]: For 71/83 co-relation queries the response was YES. [2025-03-04 06:52:56,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6543 conditions, 5660 events. 252/5660 cut-off events. For 71/83 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 61108 event pairs, 20 based on Foata normal form. 0/5264 useless extension candidates. Maximal degree in co-relation 5776. Up to 304 conditions per place. [2025-03-04 06:52:56,927 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 15 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2025-03-04 06:52:56,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 888 flow [2025-03-04 06:52:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-03-04 06:52:56,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2025-03-04 06:52:56,930 INFO L175 Difference]: Start difference. First operand has 356 places, 361 transitions, 842 flow. Second operand 3 states and 1165 transitions. [2025-03-04 06:52:56,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 888 flow [2025-03-04 06:52:56,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 365 transitions, 884 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:56,938 INFO L231 Difference]: Finished difference. Result has 355 places, 361 transitions, 848 flow [2025-03-04 06:52:56,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=355, PETRI_TRANSITIONS=361} [2025-03-04 06:52:56,939 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2025-03-04 06:52:56,939 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 361 transitions, 848 flow [2025-03-04 06:52:56,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 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) [2025-03-04 06:52:56,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:56,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:56,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:52:56,941 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:56,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1375118118, now seen corresponding path program 1 times [2025-03-04 06:52:56,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:56,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-04 06:52:56,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:56,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 06:52:56,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 06:52:56,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:56,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:56,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:56,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-04 06:52:56,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109407212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:56,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:56,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:56,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6364699] [2025-03-04 06:52:56,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:56,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:56,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:56,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:56,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2025-03-04 06:52:56,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 361 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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) [2025-03-04 06:52:56,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:56,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2025-03-04 06:52:56,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:57,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1050] thread3EXIT-->L82-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 449#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_7~0| 0), 467#true, Black: 456#true, Black: 426#true, 119#L82-16true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:57,500 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-04 06:52:57,500 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-04 06:52:57,500 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-04 06:52:57,500 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 06:52:57,500 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1050] thread3EXIT-->L82-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), Black: 449#true, 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_7~0| 0), 467#true, Black: 456#true, Black: 426#true, 119#L82-16true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:57,500 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2025-03-04 06:52:57,500 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-04 06:52:57,500 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-04 06:52:57,500 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-04 06:52:57,500 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-04 06:52:57,501 INFO L124 PetriNetUnfolderBase]: 201/5128 cut-off events. [2025-03-04 06:52:57,501 INFO L125 PetriNetUnfolderBase]: For 21/57 co-relation queries the response was YES. [2025-03-04 06:52:57,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5840 conditions, 5128 events. 201/5128 cut-off events. For 21/57 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 54008 event pairs, 6 based on Foata normal form. 0/4785 useless extension candidates. Maximal degree in co-relation 5195. Up to 140 conditions per place. [2025-03-04 06:52:57,521 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 8 selfloop transitions, 1 changer transitions 0/360 dead transitions. [2025-03-04 06:52:57,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 864 flow [2025-03-04 06:52:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-03-04 06:52:57,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2025-03-04 06:52:57,523 INFO L175 Difference]: Start difference. First operand has 355 places, 361 transitions, 848 flow. Second operand 3 states and 1165 transitions. [2025-03-04 06:52:57,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 864 flow [2025-03-04 06:52:57,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 864 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:57,527 INFO L231 Difference]: Finished difference. Result has 356 places, 360 transitions, 848 flow [2025-03-04 06:52:57,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=356, PETRI_TRANSITIONS=360} [2025-03-04 06:52:57,528 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-03-04 06:52:57,528 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 360 transitions, 848 flow [2025-03-04 06:52:57,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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) [2025-03-04 06:52:57,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:57,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:57,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:52:57,529 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:57,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:57,529 INFO L85 PathProgramCache]: Analyzing trace with hash 783458282, now seen corresponding path program 1 times [2025-03-04 06:52:57,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:57,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-03-04 06:52:57,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:57,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:57,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 06:52:57,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 06:52:57,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:57,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:57,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:57,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-03-04 06:52:57,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055825286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294625884] [2025-03-04 06:52:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:57,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:57,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:57,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:57,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:57,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2025-03-04 06:52:57,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 360 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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) [2025-03-04 06:52:57,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:57,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2025-03-04 06:52:57,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:58,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1050] thread3EXIT-->L82-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), Black: 449#true, 428#(= |#race~isNull_3~0| 0), 470#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~isNull_6~0| 0), 467#true, Black: 456#true, Black: 426#true, 119#L82-16true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:58,096 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2025-03-04 06:52:58,096 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-04 06:52:58,096 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-04 06:52:58,096 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-04 06:52:58,097 INFO L124 PetriNetUnfolderBase]: 199/5606 cut-off events. [2025-03-04 06:52:58,097 INFO L125 PetriNetUnfolderBase]: For 22/66 co-relation queries the response was YES. [2025-03-04 06:52:58,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6401 conditions, 5606 events. 199/5606 cut-off events. For 22/66 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 60359 event pairs, 23 based on Foata normal form. 0/5234 useless extension candidates. Maximal degree in co-relation 6161. Up to 158 conditions per place. [2025-03-04 06:52:58,120 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 8 selfloop transitions, 1 changer transitions 0/359 dead transitions. [2025-03-04 06:52:58,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 359 transitions, 864 flow [2025-03-04 06:52:58,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-03-04 06:52:58,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2025-03-04 06:52:58,123 INFO L175 Difference]: Start difference. First operand has 356 places, 360 transitions, 848 flow. Second operand 3 states and 1165 transitions. [2025-03-04 06:52:58,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 359 transitions, 864 flow [2025-03-04 06:52:58,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 359 transitions, 863 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:52:58,128 INFO L231 Difference]: Finished difference. Result has 356 places, 359 transitions, 847 flow [2025-03-04 06:52:58,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=356, PETRI_TRANSITIONS=359} [2025-03-04 06:52:58,129 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-03-04 06:52:58,130 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 359 transitions, 847 flow [2025-03-04 06:52:58,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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) [2025-03-04 06:52:58,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:58,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:58,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:52:58,130 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-04 06:52:58,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:58,131 INFO L85 PathProgramCache]: Analyzing trace with hash 222915510, now seen corresponding path program 1 times [2025-03-04 06:52:58,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:58,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626530937] [2025-03-04 06:52:58,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:58,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:58,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 06:52:58,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 06:52:58,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:58,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:58,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:58,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626530937] [2025-03-04 06:52:58,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626530937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:58,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:58,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:58,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133004561] [2025-03-04 06:52:58,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:58,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:58,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:58,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:58,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2025-03-04 06:52:58,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 359 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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) [2025-03-04 06:52:58,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:58,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2025-03-04 06:52:58,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:58,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([986] L56-7-->L56-5: Formula: (= |v_#race~result_11~0_3| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][234], [424#(= |#race~isNull_0~0| 0), 114#L80true, 463#true, 428#(= |#race~isNull_3~0| 0), 470#true, Black: 422#true, 148#L56-5true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 473#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 449#true, 445#true, Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:58,652 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-03-04 06:52:58,652 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-03-04 06:52:58,652 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-03-04 06:52:58,652 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-03-04 06:52:58,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([986] L56-7-->L56-5: Formula: (= |v_#race~result_11~0_3| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][234], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 470#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 148#L56-5true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:58,704 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-04 06:52:58,704 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,704 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,704 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:58,719 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([986] L56-7-->L56-5: Formula: (= |v_#race~result_11~0_3| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][234], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 470#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 148#L56-5true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:58,719 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2025-03-04 06:52:58,719 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,719 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,719 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:58,719 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:58,719 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([986] L56-7-->L56-5: Formula: (= |v_#race~result_11~0_3| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][234], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 470#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 148#L56-5true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:58,719 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-04 06:52:58,719 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,719 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,719 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:58,720 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-04 06:52:58,720 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:58,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][304], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 470#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~isNull_6~0| 0), 148#L56-5true, Black: 456#true, Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:58,720 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,720 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,720 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,720 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:58,721 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] thread2EXIT-->L80: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][304], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 470#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 148#L56-5true, 443#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_7~0| 0), Black: 456#true, Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:58,721 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-04 06:52:58,721 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,721 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,721 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:58,721 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:58,721 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([986] L56-7-->L56-5: Formula: (= |v_#race~result_11~0_3| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][234], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 451#(= |#race~filename_4~0| 0), 114#L80true, Black: 449#true, 428#(= |#race~isNull_3~0| 0), 470#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 148#L56-5true, 443#(= |#race~isNull_6~0| 0), Black: 456#true, Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~filename_5~0| 0)]) [2025-03-04 06:52:58,721 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event [2025-03-04 06:52:58,721 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2025-03-04 06:52:58,721 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2025-03-04 06:52:58,721 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-03-04 06:52:58,721 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is not cut-off event [2025-03-04 06:52:58,721 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-03-04 06:52:58,721 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-03-04 06:52:58,723 INFO L124 PetriNetUnfolderBase]: 199/3881 cut-off events. [2025-03-04 06:52:58,723 INFO L125 PetriNetUnfolderBase]: For 64/102 co-relation queries the response was YES. [2025-03-04 06:52:58,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4594 conditions, 3881 events. 199/3881 cut-off events. For 64/102 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 39097 event pairs, 48 based on Foata normal form. 24/3604 useless extension candidates. Maximal degree in co-relation 4486. Up to 239 conditions per place. [2025-03-04 06:52:58,761 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 0 selfloop transitions, 0 changer transitions 358/358 dead transitions. [2025-03-04 06:52:58,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 861 flow [2025-03-04 06:52:58,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions. [2025-03-04 06:52:58,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627791563275434 [2025-03-04 06:52:58,763 INFO L175 Difference]: Start difference. First operand has 356 places, 359 transitions, 847 flow. Second operand 3 states and 1164 transitions. [2025-03-04 06:52:58,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 861 flow [2025-03-04 06:52:58,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 358 transitions, 860 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:52:58,767 INFO L231 Difference]: Finished difference. Result has 356 places, 0 transitions, 0 flow [2025-03-04 06:52:58,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=356, PETRI_TRANSITIONS=0} [2025-03-04 06:52:58,767 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-03-04 06:52:58,767 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 0 transitions, 0 flow [2025-03-04 06:52:58,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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) [2025-03-04 06:52:58,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining) [2025-03-04 06:52:58,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-03-04 06:52:58,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-03-04 06:52:58,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-03-04 06:52:58,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-03-04 06:52:58,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-03-04 06:52:58,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-03-04 06:52:58,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-03-04 06:52:58,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-03-04 06:52:58,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-03-04 06:52:58,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-03-04 06:52:58,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-03-04 06:52:58,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-03-04 06:52:58,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-03-04 06:52:58,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-03-04 06:52:58,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-03-04 06:52:58,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:52:58,775 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-04 06:52:58,779 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:52:58,779 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:52:58,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:52:58 BasicIcfg [2025-03-04 06:52:58,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:52:58,786 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:52:58,786 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:52:58,786 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:52:58,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:49" (3/4) ... [2025-03-04 06:52:58,787 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:52:58,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:52:58,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:52:58,790 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:52:58,793 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 06:52:58,794 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:52:58,794 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:52:58,794 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:52:58,860 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:52:58,861 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:52:58,861 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:52:58,861 INFO L158 Benchmark]: Toolchain (without parser) took 10302.47ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 112.4MB in the beginning and 745.8MB in the end (delta: -633.4MB). Peak memory consumption was 414.3MB. Max. memory is 16.1GB. [2025-03-04 06:52:58,861 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:52:58,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.03ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 100.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:58,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.15ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:58,862 INFO L158 Benchmark]: Boogie Preprocessor took 29.18ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.8MB in the end (delta: 899.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:52:58,862 INFO L158 Benchmark]: IcfgBuilder took 562.49ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 70.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:52:58,862 INFO L158 Benchmark]: TraceAbstraction took 9359.45ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 69.7MB in the beginning and 754.2MB in the end (delta: -684.5MB). Peak memory consumption was 364.0MB. Max. memory is 16.1GB. [2025-03-04 06:52:58,862 INFO L158 Benchmark]: Witness Printer took 75.24ms. Allocated memory is still 1.2GB. Free memory was 754.2MB in the beginning and 745.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:58,863 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.03ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 100.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.15ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.18ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.8MB in the end (delta: 899.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 562.49ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 70.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9359.45ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 69.7MB in the beginning and 754.2MB in the end (delta: -684.5MB). Peak memory consumption was 364.0MB. Max. memory is 16.1GB. * Witness Printer took 75.24ms. Allocated memory is still 1.2GB. Free memory was 754.2MB in the beginning and 745.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 611 locations, 69 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.2s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 488 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 640 IncrementalHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 86 mSDtfsCounter, 640 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=848occurred in iteration=21, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2438 NumberOfCodeBlocks, 2438 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2414 ConstructedInterpolants, 0 QuantifiedInterpolants, 2462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:52:58,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE