./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-file-item-subst.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-subst.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 d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:52:42,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:52:42,875 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:42,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:52:42,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:52:42,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:52:42,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:52:42,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:52:42,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:52:42,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:52:42,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:52:42,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:52:42,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:52:42,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:52:42,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:52:42,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:52:42,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:52:42,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:52:42,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:52:42,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:52:42,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:52:42,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:52:42,906 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:52:42,906 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:52:42,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:52:42,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:52:42,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:52:42,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:52:42,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:52:42,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:52:42,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:52:42,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:42,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:52:42,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:52:42,907 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:52:42,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:52:42,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:52:42,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:52:42,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:52:42,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:52:42,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:52:42,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:52:42,908 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 -> d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 [2025-03-04 06:52:43,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:52:43,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:52:43,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:52:43,159 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:52:43,159 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:52:43,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2025-03-04 06:52:44,326 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b5f7067/220634c676134bbca129e0ea16c04c37/FLAGdcc95c0b3 [2025-03-04 06:52:44,590 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:52:44,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2025-03-04 06:52:44,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b5f7067/220634c676134bbca129e0ea16c04c37/FLAGdcc95c0b3 [2025-03-04 06:52:44,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b5f7067/220634c676134bbca129e0ea16c04c37 [2025-03-04 06:52:44,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:52:44,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:52:44,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:52:44,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:52:44,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:52:44,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:52:44" (1/1) ... [2025-03-04 06:52:44,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c5e155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:44, skipping insertion in model container [2025-03-04 06:52:44,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:52:44" (1/1) ... [2025-03-04 06:52:44,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:52:45,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:52:45,087 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:52:45,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:52:45,131 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:52:45,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:45 WrapperNode [2025-03-04 06:52:45,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:52:45,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:52:45,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:52:45,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:52:45,138 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:45" (1/1) ... [2025-03-04 06:52:45,145 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:45" (1/1) ... [2025-03-04 06:52:45,170 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 308 [2025-03-04 06:52:45,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:52:45,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:52:45,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:52:45,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:52:45,179 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:45" (1/1) ... [2025-03-04 06:52:45,180 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:45" (1/1) ... [2025-03-04 06:52:45,182 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:45" (1/1) ... [2025-03-04 06:52:45,188 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:45" (1/1) ... [2025-03-04 06:52:45,192 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:45" (1/1) ... [2025-03-04 06:52:45,194 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:45" (1/1) ... [2025-03-04 06:52:45,196 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:45" (1/1) ... [2025-03-04 06:52:45,197 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:45" (1/1) ... [2025-03-04 06:52:45,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:52:45,203 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:52:45,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:52:45,207 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:52:45,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:45" (1/1) ... [2025-03-04 06:52:45,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:45,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:45,251 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:45,256 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:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:52:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:52:45,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:52:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:52:45,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:52:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:52:45,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:52:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:52:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:52:45,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:52:45,276 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:45,352 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:52:45,354 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:52:45,669 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:52:45,670 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:52:45,688 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:52:45,690 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:52:45,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:45 BoogieIcfgContainer [2025-03-04 06:52:45,691 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:52:45,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:52:45,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:52:45,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:52:45,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:52:44" (1/3) ... [2025-03-04 06:52:45,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752edd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:52:45, skipping insertion in model container [2025-03-04 06:52:45,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:45" (2/3) ... [2025-03-04 06:52:45,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752edd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:52:45, skipping insertion in model container [2025-03-04 06:52:45,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:45" (3/3) ... [2025-03-04 06:52:45,699 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2025-03-04 06:52:45,712 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:52:45,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-subst.wvr.c that has 4 procedures, 392 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2025-03-04 06:52:45,715 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:52:45,804 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:52:45,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 412 transitions, 845 flow [2025-03-04 06:52:45,959 INFO L124 PetriNetUnfolderBase]: 21/409 cut-off events. [2025-03-04 06:52:45,960 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:52:45,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 409 events. 21/409 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1088 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 283. Up to 2 conditions per place. [2025-03-04 06:52:45,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 412 transitions, 845 flow [2025-03-04 06:52:46,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 389 transitions, 796 flow [2025-03-04 06:52:46,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:52:46,025 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;@6fb74d8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:52:46,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-03-04 06:52:46,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:52:46,031 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-03-04 06:52:46,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:52:46,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:46,032 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:46,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:46,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:46,036 INFO L85 PathProgramCache]: Analyzing trace with hash -854569501, now seen corresponding path program 1 times [2025-03-04 06:52:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:46,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675033860] [2025-03-04 06:52:46,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:46,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:46,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 06:52:46,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 06:52:46,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:46,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:46,174 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:46,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:46,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675033860] [2025-03-04 06:52:46,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675033860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:46,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:46,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:46,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296943070] [2025-03-04 06:52:46,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:46,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:46,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:46,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:46,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:46,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-03-04 06:52:46,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 389 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:46,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:46,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-03-04 06:52:46,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:46,372 INFO L124 PetriNetUnfolderBase]: 35/716 cut-off events. [2025-03-04 06:52:46,372 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-04 06:52:46,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 716 events. 35/716 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3275 event pairs, 7 based on Foata normal form. 23/617 useless extension candidates. Maximal degree in co-relation 608. Up to 25 conditions per place. [2025-03-04 06:52:46,385 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 11 selfloop transitions, 2 changer transitions 1/381 dead transitions. [2025-03-04 06:52:46,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 381 transitions, 806 flow [2025-03-04 06:52:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-03-04 06:52:46,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-03-04 06:52:46,402 INFO L175 Difference]: Start difference. First operand has 380 places, 389 transitions, 796 flow. Second operand 3 states and 1185 transitions. [2025-03-04 06:52:46,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 381 transitions, 806 flow [2025-03-04 06:52:46,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 381 transitions, 794 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:52:46,415 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 770 flow [2025-03-04 06:52:46,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=375, PETRI_TRANSITIONS=380} [2025-03-04 06:52:46,422 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -5 predicate places. [2025-03-04 06:52:46,424 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 770 flow [2025-03-04 06:52:46,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:46,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:46,425 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:46,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:52:46,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:46,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:46,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1968651007, now seen corresponding path program 1 times [2025-03-04 06:52:46,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:46,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157378622] [2025-03-04 06:52:46,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:46,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:46,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 06:52:46,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 06:52:46,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:46,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:46,495 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:46,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157378622] [2025-03-04 06:52:46,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157378622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:46,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:46,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:46,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500692111] [2025-03-04 06:52:46,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:46,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:46,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:46,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:46,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:46,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-03-04 06:52:46,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:46,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:46,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-03-04 06:52:46,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:46,586 INFO L124 PetriNetUnfolderBase]: 25/551 cut-off events. [2025-03-04 06:52:46,587 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-04 06:52:46,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 551 events. 25/551 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2209 event pairs, 5 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 547. Up to 22 conditions per place. [2025-03-04 06:52:46,594 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2025-03-04 06:52:46,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 794 flow [2025-03-04 06:52:46,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-03-04 06:52:46,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-03-04 06:52:46,598 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 770 flow. Second operand 3 states and 1178 transitions. [2025-03-04 06:52:46,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 794 flow [2025-03-04 06:52:46,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 379 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:46,606 INFO L231 Difference]: Finished difference. Result has 373 places, 379 transitions, 768 flow [2025-03-04 06:52:46,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=373, PETRI_TRANSITIONS=379} [2025-03-04 06:52:46,608 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2025-03-04 06:52:46,609 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 379 transitions, 768 flow [2025-03-04 06:52:46,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:46,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:46,610 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:46,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:52:46,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:46,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:46,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1456565150, now seen corresponding path program 1 times [2025-03-04 06:52:46,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:46,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062106352] [2025-03-04 06:52:46,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:46,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:46,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 06:52:46,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 06:52:46,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:46,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:46,651 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:46,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:46,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062106352] [2025-03-04 06:52:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062106352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:46,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:46,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:46,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416517138] [2025-03-04 06:52:46,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:46,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:46,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:46,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:46,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:46,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-03-04 06:52:46,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 379 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:46,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:46,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-03-04 06:52:46,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:46,752 INFO L124 PetriNetUnfolderBase]: 23/470 cut-off events. [2025-03-04 06:52:46,753 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-04 06:52:46,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 470 events. 23/470 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1652 event pairs, 7 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 460. Up to 25 conditions per place. [2025-03-04 06:52:46,759 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2025-03-04 06:52:46,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 378 transitions, 792 flow [2025-03-04 06:52:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-03-04 06:52:46,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-03-04 06:52:46,762 INFO L175 Difference]: Start difference. First operand has 373 places, 379 transitions, 768 flow. Second operand 3 states and 1178 transitions. [2025-03-04 06:52:46,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 378 transitions, 792 flow [2025-03-04 06:52:46,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 378 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:46,776 INFO L231 Difference]: Finished difference. Result has 372 places, 378 transitions, 766 flow [2025-03-04 06:52:46,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=372, PETRI_TRANSITIONS=378} [2025-03-04 06:52:46,777 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -8 predicate places. [2025-03-04 06:52:46,777 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 378 transitions, 766 flow [2025-03-04 06:52:46,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:46,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:46,779 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:46,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:52:46,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:46,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:46,780 INFO L85 PathProgramCache]: Analyzing trace with hash 222568688, now seen corresponding path program 1 times [2025-03-04 06:52:46,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:46,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133984065] [2025-03-04 06:52:46,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:46,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 06:52:46,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 06:52:46,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:46,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:46,850 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:46,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:46,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133984065] [2025-03-04 06:52:46,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133984065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:46,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:46,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:46,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161701870] [2025-03-04 06:52:46,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:46,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:46,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:46,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:46,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:46,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-03-04 06:52:46,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 378 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:46,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:46,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-03-04 06:52:46,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:46,983 INFO L124 PetriNetUnfolderBase]: 43/846 cut-off events. [2025-03-04 06:52:46,983 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:52:46,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 846 events. 43/846 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4585 event pairs, 7 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 831. Up to 25 conditions per place. [2025-03-04 06:52:46,997 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-03-04 06:52:46,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 377 transitions, 790 flow [2025-03-04 06:52:46,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-03-04 06:52:47,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-03-04 06:52:47,001 INFO L175 Difference]: Start difference. First operand has 372 places, 378 transitions, 766 flow. Second operand 3 states and 1178 transitions. [2025-03-04 06:52:47,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 377 transitions, 790 flow [2025-03-04 06:52:47,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 377 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:47,005 INFO L231 Difference]: Finished difference. Result has 371 places, 377 transitions, 764 flow [2025-03-04 06:52:47,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=371, PETRI_TRANSITIONS=377} [2025-03-04 06:52:47,006 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2025-03-04 06:52:47,007 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 377 transitions, 764 flow [2025-03-04 06:52:47,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:47,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:47,008 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:47,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:52:47,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:47,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1494809688, now seen corresponding path program 1 times [2025-03-04 06:52:47,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:47,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804426066] [2025-03-04 06:52:47,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:47,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:47,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:52:47,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:52:47,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:47,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:47,075 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:47,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804426066] [2025-03-04 06:52:47,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804426066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:47,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:47,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:47,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997374097] [2025-03-04 06:52:47,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:47,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:47,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:47,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:47,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:47,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-03-04 06:52:47,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 377 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:47,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:47,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-03-04 06:52:47,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:47,170 INFO L124 PetriNetUnfolderBase]: 32/602 cut-off events. [2025-03-04 06:52:47,171 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:52:47,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 602 events. 32/602 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2762 event pairs, 8 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 583. Up to 29 conditions per place. [2025-03-04 06:52:47,178 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-03-04 06:52:47,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 376 transitions, 790 flow [2025-03-04 06:52:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2025-03-04 06:52:47,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2025-03-04 06:52:47,181 INFO L175 Difference]: Start difference. First operand has 371 places, 377 transitions, 764 flow. Second operand 3 states and 1176 transitions. [2025-03-04 06:52:47,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 376 transitions, 790 flow [2025-03-04 06:52:47,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 376 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:47,185 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 762 flow [2025-03-04 06:52:47,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=370, PETRI_TRANSITIONS=376} [2025-03-04 06:52:47,187 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2025-03-04 06:52:47,187 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 762 flow [2025-03-04 06:52:47,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:47,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:47,188 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:47,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:52:47,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:47,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1855395868, now seen corresponding path program 1 times [2025-03-04 06:52:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441094069] [2025-03-04 06:52:47,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:47,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:52:47,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:52:47,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:47,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:47,243 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:47,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:47,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441094069] [2025-03-04 06:52:47,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441094069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:47,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863657826] [2025-03-04 06:52:47,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:47,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:47,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:47,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:47,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:47,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2025-03-04 06:52:47,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 376 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:47,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:47,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2025-03-04 06:52:47,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:47,364 INFO L124 PetriNetUnfolderBase]: 64/971 cut-off events. [2025-03-04 06:52:47,364 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-03-04 06:52:47,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 971 events. 64/971 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5225 event pairs, 20 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 963. Up to 50 conditions per place. [2025-03-04 06:52:47,377 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-03-04 06:52:47,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 375 transitions, 790 flow [2025-03-04 06:52:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2025-03-04 06:52:47,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2025-03-04 06:52:47,380 INFO L175 Difference]: Start difference. First operand has 370 places, 376 transitions, 762 flow. Second operand 3 states and 1174 transitions. [2025-03-04 06:52:47,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 375 transitions, 790 flow [2025-03-04 06:52:47,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 375 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:47,387 INFO L231 Difference]: Finished difference. Result has 369 places, 375 transitions, 760 flow [2025-03-04 06:52:47,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=369, PETRI_TRANSITIONS=375} [2025-03-04 06:52:47,389 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2025-03-04 06:52:47,390 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 375 transitions, 760 flow [2025-03-04 06:52:47,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:47,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:47,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] [2025-03-04 06:52:47,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:52:47,391 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:47,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash -744845977, now seen corresponding path program 1 times [2025-03-04 06:52:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:47,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560652925] [2025-03-04 06:52:47,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:47,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 06:52:47,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:52:47,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:47,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:47,459 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:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:47,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560652925] [2025-03-04 06:52:47,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560652925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:47,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:47,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:47,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790843486] [2025-03-04 06:52:47,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:47,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:47,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:47,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:47,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-03-04 06:52:47,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 375 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:47,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:47,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-03-04 06:52:47,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:47,567 INFO L124 PetriNetUnfolderBase]: 35/709 cut-off events. [2025-03-04 06:52:47,567 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-03-04 06:52:47,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 709 events. 35/709 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3492 event pairs, 7 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 670. Up to 25 conditions per place. [2025-03-04 06:52:47,579 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-03-04 06:52:47,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 374 transitions, 784 flow [2025-03-04 06:52:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-03-04 06:52:47,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-03-04 06:52:47,582 INFO L175 Difference]: Start difference. First operand has 369 places, 375 transitions, 760 flow. Second operand 3 states and 1178 transitions. [2025-03-04 06:52:47,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 374 transitions, 784 flow [2025-03-04 06:52:47,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:47,587 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 758 flow [2025-03-04 06:52:47,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2025-03-04 06:52:47,588 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2025-03-04 06:52:47,588 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 758 flow [2025-03-04 06:52:47,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:47,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:47,589 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:47,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:52:47,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:47,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1455637067, now seen corresponding path program 1 times [2025-03-04 06:52:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:47,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687197317] [2025-03-04 06:52:47,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:47,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:52:47,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:52:47,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:47,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:47,649 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:47,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:47,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687197317] [2025-03-04 06:52:47,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687197317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:47,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:47,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:47,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595755400] [2025-03-04 06:52:47,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:47,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:47,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:47,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:47,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:47,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-03-04 06:52:47,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:47,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:47,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-03-04 06:52:47,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:47,767 INFO L124 PetriNetUnfolderBase]: 41/836 cut-off events. [2025-03-04 06:52:47,767 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-04 06:52:47,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 836 events. 41/836 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4261 event pairs, 8 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 794. Up to 30 conditions per place. [2025-03-04 06:52:47,775 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-03-04 06:52:47,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 784 flow [2025-03-04 06:52:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2025-03-04 06:52:47,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2025-03-04 06:52:47,781 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 758 flow. Second operand 3 states and 1176 transitions. [2025-03-04 06:52:47,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 784 flow [2025-03-04 06:52:47,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:47,786 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 756 flow [2025-03-04 06:52:47,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=367, PETRI_TRANSITIONS=373} [2025-03-04 06:52:47,787 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2025-03-04 06:52:47,788 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 756 flow [2025-03-04 06:52:47,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:47,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:47,789 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:47,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:52:47,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:47,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:47,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1390855364, now seen corresponding path program 1 times [2025-03-04 06:52:47,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:47,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884505129] [2025-03-04 06:52:47,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:47,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:47,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:52:47,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:52:47,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:47,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:47,836 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:47,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:47,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884505129] [2025-03-04 06:52:47,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884505129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:47,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:47,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:47,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350656291] [2025-03-04 06:52:47,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:47,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:47,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:47,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:47,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:47,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2025-03-04 06:52:47,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 373 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:47,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:47,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2025-03-04 06:52:47,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:47,919 INFO L124 PetriNetUnfolderBase]: 40/564 cut-off events. [2025-03-04 06:52:47,920 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2025-03-04 06:52:47,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 564 events. 40/564 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2654 event pairs, 20 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 532. Up to 50 conditions per place. [2025-03-04 06:52:47,927 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-03-04 06:52:47,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 784 flow [2025-03-04 06:52:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2025-03-04 06:52:47,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2025-03-04 06:52:47,930 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 756 flow. Second operand 3 states and 1174 transitions. [2025-03-04 06:52:47,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 784 flow [2025-03-04 06:52:47,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:47,934 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 754 flow [2025-03-04 06:52:47,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=364, 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=366, PETRI_TRANSITIONS=372} [2025-03-04 06:52:47,935 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2025-03-04 06:52:47,935 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 754 flow [2025-03-04 06:52:47,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:47,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:47,936 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:47,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:52:47,937 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:47,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1000658581, now seen corresponding path program 1 times [2025-03-04 06:52:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:47,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828667333] [2025-03-04 06:52:47,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:47,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:47,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 06:52:47,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 06:52:47,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:47,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:47,993 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:47,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:47,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828667333] [2025-03-04 06:52:47,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828667333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:47,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:47,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511699855] [2025-03-04 06:52:47,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:47,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:47,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:47,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:47,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:48,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-04 06:52:48,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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:48,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:48,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-04 06:52:48,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:48,112 INFO L124 PetriNetUnfolderBase]: 76/1238 cut-off events. [2025-03-04 06:52:48,112 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:52:48,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1238 events. 76/1238 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8564 event pairs, 13 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1202. Up to 43 conditions per place. [2025-03-04 06:52:48,123 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-03-04 06:52:48,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 374 transitions, 790 flow [2025-03-04 06:52:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2025-03-04 06:52:48,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2025-03-04 06:52:48,125 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 754 flow. Second operand 3 states and 1187 transitions. [2025-03-04 06:52:48,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 374 transitions, 790 flow [2025-03-04 06:52:48,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:48,130 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 760 flow [2025-03-04 06:52:48,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2025-03-04 06:52:48,130 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-04 06:52:48,130 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 760 flow [2025-03-04 06:52:48,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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:48,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:48,131 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:48,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:52:48,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:48,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash 749006453, now seen corresponding path program 1 times [2025-03-04 06:52:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:48,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426243632] [2025-03-04 06:52:48,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:48,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:48,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 06:52:48,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 06:52:48,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:48,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:48,173 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:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426243632] [2025-03-04 06:52:48,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426243632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:48,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:48,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:48,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440275328] [2025-03-04 06:52:48,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:48,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:48,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:48,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:48,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:48,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-03-04 06:52:48,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:48,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:48,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-03-04 06:52:48,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:48,323 INFO L124 PetriNetUnfolderBase]: 77/1268 cut-off events. [2025-03-04 06:52:48,323 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:52:48,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 1268 events. 77/1268 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 8508 event pairs, 12 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1156. Up to 49 conditions per place. [2025-03-04 06:52:48,336 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 15 selfloop transitions, 3 changer transitions 0/374 dead transitions. [2025-03-04 06:52:48,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 374 transitions, 802 flow [2025-03-04 06:52:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-03-04 06:52:48,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2025-03-04 06:52:48,338 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 760 flow. Second operand 3 states and 1182 transitions. [2025-03-04 06:52:48,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 374 transitions, 802 flow [2025-03-04 06:52:48,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:48,343 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 775 flow [2025-03-04 06:52:48,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2025-03-04 06:52:48,344 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-04 06:52:48,344 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 775 flow [2025-03-04 06:52:48,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:48,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:48,345 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:48,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:52:48,345 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:48,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:48,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1296939060, now seen corresponding path program 1 times [2025-03-04 06:52:48,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:48,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585488566] [2025-03-04 06:52:48,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:48,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:48,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:52:48,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:52:48,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:48,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:48,394 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:48,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:48,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585488566] [2025-03-04 06:52:48,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585488566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:48,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:48,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:48,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686257358] [2025-03-04 06:52:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:48,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:48,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:48,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:48,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:48,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-04 06:52:48,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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:48,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:48,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-04 06:52:48,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:48,545 INFO L124 PetriNetUnfolderBase]: 70/1296 cut-off events. [2025-03-04 06:52:48,545 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2025-03-04 06:52:48,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 1296 events. 70/1296 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9314 event pairs, 4 based on Foata normal form. 1/1110 useless extension candidates. Maximal degree in co-relation 1117. Up to 53 conditions per place. [2025-03-04 06:52:48,557 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-03-04 06:52:48,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 377 transitions, 826 flow [2025-03-04 06:52:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-03-04 06:52:48,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2025-03-04 06:52:48,560 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 775 flow. Second operand 3 states and 1190 transitions. [2025-03-04 06:52:48,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 377 transitions, 826 flow [2025-03-04 06:52:48,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 377 transitions, 826 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:48,566 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 785 flow [2025-03-04 06:52:48,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2025-03-04 06:52:48,568 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2025-03-04 06:52:48,568 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 785 flow [2025-03-04 06:52:48,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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:48,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:48,569 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:48,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:52:48,569 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:48,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:48,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1871533993, now seen corresponding path program 1 times [2025-03-04 06:52:48,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:48,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5785829] [2025-03-04 06:52:48,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:48,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:48,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:52:48,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:52:48,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:48,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:48,619 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:48,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:48,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5785829] [2025-03-04 06:52:48,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5785829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:48,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:48,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:48,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984630694] [2025-03-04 06:52:48,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:48,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:48,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:48,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:48,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 412 [2025-03-04 06:52:48,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 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:48,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:48,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 412 [2025-03-04 06:52:48,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:48,756 INFO L124 PetriNetUnfolderBase]: 57/1056 cut-off events. [2025-03-04 06:52:48,756 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:52:48,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 1056 events. 57/1056 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6839 event pairs, 8 based on Foata normal form. 0/907 useless extension candidates. Maximal degree in co-relation 957. Up to 32 conditions per place. [2025-03-04 06:52:48,770 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-03-04 06:52:48,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 373 transitions, 815 flow [2025-03-04 06:52:48,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2025-03-04 06:52:48,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2025-03-04 06:52:48,773 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 785 flow. Second operand 3 states and 1187 transitions. [2025-03-04 06:52:48,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 373 transitions, 815 flow [2025-03-04 06:52:48,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 815 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:48,777 INFO L231 Difference]: Finished difference. Result has 367 places, 371 transitions, 787 flow [2025-03-04 06:52:48,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=365, 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=787, PETRI_PLACES=367, PETRI_TRANSITIONS=371} [2025-03-04 06:52:48,778 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2025-03-04 06:52:48,778 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 371 transitions, 787 flow [2025-03-04 06:52:48,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 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:48,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:48,779 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:48,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:52:48,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:48,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash -413447936, now seen corresponding path program 1 times [2025-03-04 06:52:48,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:48,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969349392] [2025-03-04 06:52:48,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:48,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:48,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 06:52:48,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 06:52:48,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:48,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:48,813 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:48,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:48,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969349392] [2025-03-04 06:52:48,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969349392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:48,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:48,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898367755] [2025-03-04 06:52:48,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:48,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:48,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:48,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:48,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-03-04 06:52:48,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 371 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:48,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:48,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-03-04 06:52:48,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:48,978 INFO L124 PetriNetUnfolderBase]: 75/1424 cut-off events. [2025-03-04 06:52:48,978 INFO L125 PetriNetUnfolderBase]: For 14/24 co-relation queries the response was YES. [2025-03-04 06:52:48,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1553 conditions, 1424 events. 75/1424 cut-off events. For 14/24 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9896 event pairs, 8 based on Foata normal form. 1/1232 useless extension candidates. Maximal degree in co-relation 1346. Up to 69 conditions per place. [2025-03-04 06:52:48,999 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 18 selfloop transitions, 3 changer transitions 0/376 dead transitions. [2025-03-04 06:52:48,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 376 transitions, 844 flow [2025-03-04 06:52:49,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-03-04 06:52:49,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-03-04 06:52:49,002 INFO L175 Difference]: Start difference. First operand has 367 places, 371 transitions, 787 flow. Second operand 3 states and 1185 transitions. [2025-03-04 06:52:49,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 376 transitions, 844 flow [2025-03-04 06:52:49,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 376 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:49,006 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 798 flow [2025-03-04 06:52:49,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2025-03-04 06:52:49,006 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-04 06:52:49,006 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 798 flow [2025-03-04 06:52:49,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:49,007 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:49,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:52:49,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:49,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:49,008 INFO L85 PathProgramCache]: Analyzing trace with hash -750544541, now seen corresponding path program 1 times [2025-03-04 06:52:49,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:49,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307602594] [2025-03-04 06:52:49,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:49,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:49,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 06:52:49,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 06:52:49,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:49,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:49,036 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,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307602594] [2025-03-04 06:52:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307602594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:49,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:49,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089955208] [2025-03-04 06:52:49,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:49,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:49,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:49,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:49,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2025-03-04 06:52:49,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:49,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2025-03-04 06:52:49,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:49,397 INFO L124 PetriNetUnfolderBase]: 321/3956 cut-off events. [2025-03-04 06:52:49,397 INFO L125 PetriNetUnfolderBase]: For 70/160 co-relation queries the response was YES. [2025-03-04 06:52:49,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4445 conditions, 3956 events. 321/3956 cut-off events. For 70/160 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 40873 event pairs, 100 based on Foata normal form. 1/3423 useless extension candidates. Maximal degree in co-relation 3792. Up to 329 conditions per place. [2025-03-04 06:52:49,420 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 17 selfloop transitions, 4 changer transitions 0/373 dead transitions. [2025-03-04 06:52:49,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 373 transitions, 846 flow [2025-03-04 06:52:49,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1177 transitions. [2025-03-04 06:52:49,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522653721682848 [2025-03-04 06:52:49,423 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 798 flow. Second operand 3 states and 1177 transitions. [2025-03-04 06:52:49,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 373 transitions, 846 flow [2025-03-04 06:52:49,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 373 transitions, 846 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:49,428 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 818 flow [2025-03-04 06:52:49,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2025-03-04 06:52:49,429 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-03-04 06:52:49,429 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 818 flow [2025-03-04 06:52:49,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:49,430 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:49,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:52:49,430 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:49,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:49,431 INFO L85 PathProgramCache]: Analyzing trace with hash 939566880, now seen corresponding path program 1 times [2025-03-04 06:52:49,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:49,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727245357] [2025-03-04 06:52:49,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:49,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:49,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:52:49,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:52:49,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:49,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:49,472 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,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:49,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727245357] [2025-03-04 06:52:49,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727245357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:49,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:49,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:49,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980412264] [2025-03-04 06:52:49,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:49,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:49,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:49,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:49,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:49,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-04 06:52:49,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:49,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-04 06:52:49,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:49,826 INFO L124 PetriNetUnfolderBase]: 114/2582 cut-off events. [2025-03-04 06:52:49,827 INFO L125 PetriNetUnfolderBase]: For 12/18 co-relation queries the response was YES. [2025-03-04 06:52:49,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 2582 events. 114/2582 cut-off events. For 12/18 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 22987 event pairs, 4 based on Foata normal form. 0/2259 useless extension candidates. Maximal degree in co-relation 2341. Up to 68 conditions per place. [2025-03-04 06:52:49,854 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-03-04 06:52:49,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 376 transitions, 869 flow [2025-03-04 06:52:49,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-03-04 06:52:49,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2025-03-04 06:52:49,857 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 818 flow. Second operand 3 states and 1190 transitions. [2025-03-04 06:52:49,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 376 transitions, 869 flow [2025-03-04 06:52:49,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 376 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:49,861 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 828 flow [2025-03-04 06:52:49,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2025-03-04 06:52:49,862 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-04 06:52:49,862 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 828 flow [2025-03-04 06:52:49,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:49,863 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:49,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:52:49,863 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:49,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash 980666370, now seen corresponding path program 1 times [2025-03-04 06:52:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:49,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727969645] [2025-03-04 06:52:49,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:49,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:52:49,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:52:49,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:49,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:49,904 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,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727969645] [2025-03-04 06:52:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727969645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:49,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:49,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:49,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282693657] [2025-03-04 06:52:49,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:49,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:49,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:49,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:49,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-04 06:52:49,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:49,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-04 06:52:49,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:50,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][351], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 42#L56-25true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 435#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:50,279 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2025-03-04 06:52:50,279 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-04 06:52:50,279 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-04 06:52:50,279 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-04 06:52:50,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][351], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 305#L56-26true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 435#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:50,284 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-03-04 06:52:50,284 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-04 06:52:50,284 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-04 06:52:50,284 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-04 06:52:50,298 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][351], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 42#L56-25true, 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 435#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:50,298 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2025-03-04 06:52:50,298 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2025-03-04 06:52:50,298 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2025-03-04 06:52:50,298 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2025-03-04 06:52:50,298 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2025-03-04 06:52:50,299 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][351], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 305#L56-26true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 435#true, 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 98#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:50,299 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is not cut-off event [2025-03-04 06:52:50,299 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is not cut-off event [2025-03-04 06:52:50,299 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2025-03-04 06:52:50,299 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is not cut-off event [2025-03-04 06:52:50,299 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2025-03-04 06:52:50,314 INFO L124 PetriNetUnfolderBase]: 126/3379 cut-off events. [2025-03-04 06:52:50,314 INFO L125 PetriNetUnfolderBase]: For 43/80 co-relation queries the response was YES. [2025-03-04 06:52:50,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3680 conditions, 3379 events. 126/3379 cut-off events. For 43/80 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 30892 event pairs, 14 based on Foata normal form. 2/3002 useless extension candidates. Maximal degree in co-relation 3236. Up to 140 conditions per place. [2025-03-04 06:52:50,342 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-03-04 06:52:50,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 376 transitions, 879 flow [2025-03-04 06:52:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-03-04 06:52:50,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2025-03-04 06:52:50,346 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 828 flow. Second operand 3 states and 1190 transitions. [2025-03-04 06:52:50,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 376 transitions, 879 flow [2025-03-04 06:52:50,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 376 transitions, 879 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:50,350 INFO L231 Difference]: Finished difference. Result has 366 places, 371 transitions, 838 flow [2025-03-04 06:52:50,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=366, PETRI_TRANSITIONS=371} [2025-03-04 06:52:50,351 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2025-03-04 06:52:50,351 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 371 transitions, 838 flow [2025-03-04 06:52:50,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:50,353 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:50,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:52:50,353 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:50,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:50,353 INFO L85 PathProgramCache]: Analyzing trace with hash 253529721, now seen corresponding path program 1 times [2025-03-04 06:52:50,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:50,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717292647] [2025-03-04 06:52:50,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:50,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:50,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:52:50,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:52:50,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:50,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:50,387 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,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:50,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717292647] [2025-03-04 06:52:50,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717292647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:50,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:50,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:50,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212370625] [2025-03-04 06:52:50,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:50,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:50,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:50,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:50,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:50,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-04 06:52:50,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 371 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 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,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:50,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-04 06:52:50,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:50,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1068] thread3EXIT-->L82-5: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][349], [120#L82-5true, 437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 462#true, 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 458#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 435#true, 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:50,804 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-04 06:52:50,804 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-03-04 06:52:50,805 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-04 06:52:50,805 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 06:52:50,809 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1068] thread3EXIT-->L82-5: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][349], [120#L82-5true, 437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), 462#true, Black: 450#true, Black: 454#true, Black: 458#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 435#true, 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:50,809 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-04 06:52:50,809 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 06:52:50,809 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-03-04 06:52:50,809 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-04 06:52:50,809 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 06:52:50,812 INFO L124 PetriNetUnfolderBase]: 201/4618 cut-off events. [2025-03-04 06:52:50,812 INFO L125 PetriNetUnfolderBase]: For 51/168 co-relation queries the response was YES. [2025-03-04 06:52:50,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5191 conditions, 4618 events. 201/4618 cut-off events. For 51/168 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 46783 event pairs, 30 based on Foata normal form. 7/4091 useless extension candidates. Maximal degree in co-relation 4318. Up to 136 conditions per place. [2025-03-04 06:52:50,851 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-03-04 06:52:50,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 372 transitions, 870 flow [2025-03-04 06:52:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-03-04 06:52:50,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-03-04 06:52:50,854 INFO L175 Difference]: Start difference. First operand has 366 places, 371 transitions, 838 flow. Second operand 3 states and 1185 transitions. [2025-03-04 06:52:50,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 372 transitions, 870 flow [2025-03-04 06:52:50,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 372 transitions, 870 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:50,858 INFO L231 Difference]: Finished difference. Result has 367 places, 370 transitions, 840 flow [2025-03-04 06:52:50,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=365, 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=840, PETRI_PLACES=367, PETRI_TRANSITIONS=370} [2025-03-04 06:52:50,858 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2025-03-04 06:52:50,858 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 370 transitions, 840 flow [2025-03-04 06:52:50,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 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,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:50,859 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:50,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:52:50,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:50,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1039016844, now seen corresponding path program 1 times [2025-03-04 06:52:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:50,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066868474] [2025-03-04 06:52:50,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:50,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:50,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 06:52:50,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 06:52:50,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:50,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:50,889 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,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:50,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066868474] [2025-03-04 06:52:50,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066868474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:50,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:50,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479261018] [2025-03-04 06:52:50,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:50,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:50,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:50,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:50,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2025-03-04 06:52:50,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 370 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:50,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2025-03-04 06:52:50,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:51,667 INFO L124 PetriNetUnfolderBase]: 456/7770 cut-off events. [2025-03-04 06:52:51,667 INFO L125 PetriNetUnfolderBase]: For 134/150 co-relation queries the response was YES. [2025-03-04 06:52:51,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8847 conditions, 7770 events. 456/7770 cut-off events. For 134/150 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 92518 event pairs, 76 based on Foata normal form. 2/7022 useless extension candidates. Maximal degree in co-relation 7826. Up to 616 conditions per place. [2025-03-04 06:52:51,727 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 19 selfloop transitions, 4 changer transitions 0/374 dead transitions. [2025-03-04 06:52:51,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 374 transitions, 898 flow [2025-03-04 06:52:51,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1179 transitions. [2025-03-04 06:52:51,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9538834951456311 [2025-03-04 06:52:51,730 INFO L175 Difference]: Start difference. First operand has 367 places, 370 transitions, 840 flow. Second operand 3 states and 1179 transitions. [2025-03-04 06:52:51,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 374 transitions, 898 flow [2025-03-04 06:52:51,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 374 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:51,736 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 856 flow [2025-03-04 06:52:51,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=364, PETRI_TRANSITIONS=370} [2025-03-04 06:52:51,737 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-03-04 06:52:51,737 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 856 flow [2025-03-04 06:52:51,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:51,737 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:51,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:52:51,738 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:51,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1019368796, now seen corresponding path program 1 times [2025-03-04 06:52:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804485843] [2025-03-04 06:52:51,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:51,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:52:51,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:52:51,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:51,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:51,772 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,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:51,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804485843] [2025-03-04 06:52:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804485843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:51,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:51,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:51,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463962900] [2025-03-04 06:52:51,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:51,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:51,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:51,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:51,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:51,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-04 06:52:51,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 370 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 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,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:51,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-04 06:52:51,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:52,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1068] thread3EXIT-->L82-5: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][349], [120#L82-5true, 437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), Black: 450#true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, Black: 431#true, 458#true, Black: 465#true, Black: 435#true, 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:52,444 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2025-03-04 06:52:52,444 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-03-04 06:52:52,444 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-03-04 06:52:52,444 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2025-03-04 06:52:52,504 INFO L124 PetriNetUnfolderBase]: 240/5926 cut-off events. [2025-03-04 06:52:52,504 INFO L125 PetriNetUnfolderBase]: For 70/80 co-relation queries the response was YES. [2025-03-04 06:52:52,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6606 conditions, 5926 events. 240/5926 cut-off events. For 70/80 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 64172 event pairs, 20 based on Foata normal form. 0/5413 useless extension candidates. Maximal degree in co-relation 5808. Up to 300 conditions per place. [2025-03-04 06:52:52,539 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 15 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-03-04 06:52:52,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 374 transitions, 902 flow [2025-03-04 06:52:52,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2025-03-04 06:52:52,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2025-03-04 06:52:52,542 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 856 flow. Second operand 3 states and 1189 transitions. [2025-03-04 06:52:52,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 374 transitions, 902 flow [2025-03-04 06:52:52,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 902 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:52,546 INFO L231 Difference]: Finished difference. Result has 365 places, 370 transitions, 866 flow [2025-03-04 06:52:52,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=365, PETRI_TRANSITIONS=370} [2025-03-04 06:52:52,547 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-04 06:52:52,547 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 370 transitions, 866 flow [2025-03-04 06:52:52,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 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,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:52,548 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:52,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:52:52,548 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:52,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1680320242, now seen corresponding path program 1 times [2025-03-04 06:52:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:52,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574095439] [2025-03-04 06:52:52,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:52,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:52:52,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:52:52,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:52,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:52,579 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,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:52,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574095439] [2025-03-04 06:52:52,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574095439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:52,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:52,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:52,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94007345] [2025-03-04 06:52:52,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:52,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:52,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:52,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:52,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:52,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-04 06:52:52,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 370 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:52,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-04 06:52:52,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:52,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet18#1][228], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), Black: 450#true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 473#true, Black: 431#true, 458#true, Black: 465#true, Black: 435#true, 448#(= 0 |#race~filename_is_null_5~0|), 103#L56-7true, 98#L80true, Black: 439#true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:52,933 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-03-04 06:52:52,933 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-03-04 06:52:52,933 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-03-04 06:52:52,933 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-03-04 06:52:52,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet18#1][228], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 473#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, Black: 469#true, 471#(= |#race~filename_7~0| 0), 448#(= 0 |#race~filename_is_null_5~0|), 103#L56-7true, 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:52,992 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-03-04 06:52:52,992 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:52,992 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:52,992 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][303], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 473#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, 103#L56-7true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,016 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,016 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,016 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:53,016 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][303], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 473#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, 103#L56-7true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,017 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1000] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet18#1][228], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 473#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 103#L56-7true, 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,017 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1000] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet18#1][228], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 473#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, Black: 469#true, 471#(= |#race~filename_7~0| 0), 448#(= 0 |#race~filename_is_null_5~0|), 103#L56-7true, 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,017 INFO L294 olderBase$Statistics]: this new event has 270 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,017 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 298#L56-5true, 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, 475#(= |thread3Thread1of1ForFork1_#t~nondet18#1| |#race~result_11~0|), Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,018 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-04 06:52:53,018 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:53,018 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:53,018 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:53,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 460#(= |#race~filename_4~0| 0), 40#L56-6true, Black: 431#true, Black: 465#true, 475#(= |thread3Thread1of1ForFork1_#t~nondet18#1| |#race~result_11~0|), Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,020 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2025-03-04 06:52:53,020 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:52:53,020 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:52:53,020 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-03-04 06:52:53,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][303], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 473#true, 146#L58true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,024 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-03-04 06:52:53,024 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,024 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,024 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-04 06:52:53,024 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1000] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet18#1][228], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 473#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 103#L56-7true, 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,024 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is not cut-off event [2025-03-04 06:52:53,024 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2025-03-04 06:52:53,024 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2025-03-04 06:52:53,024 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-04 06:52:53,024 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is not cut-off event [2025-03-04 06:52:53,024 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-04 06:52:53,025 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-04 06:52:53,025 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), 298#L56-5true, Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, 475#(= |thread3Thread1of1ForFork1_#t~nondet18#1| |#race~result_11~0|), Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,025 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-04 06:52:53,025 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:53,025 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:53,025 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:53,025 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:53,025 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 460#(= |#race~filename_4~0| 0), 40#L56-6true, Black: 431#true, Black: 465#true, 475#(= |thread3Thread1of1ForFork1_#t~nondet18#1| |#race~result_11~0|), Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 98#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,025 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-03-04 06:52:53,025 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:52:53,025 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:52:53,025 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-03-04 06:52:53,025 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-03-04 06:52:53,026 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][303], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 473#true, 146#L58true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,026 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,026 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,026 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-04 06:52:53,026 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-04 06:52:53,026 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-04 06:52:53,028 INFO L124 PetriNetUnfolderBase]: 395/4655 cut-off events. [2025-03-04 06:52:53,028 INFO L125 PetriNetUnfolderBase]: For 258/395 co-relation queries the response was YES. [2025-03-04 06:52:53,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5969 conditions, 4655 events. 395/4655 cut-off events. For 258/395 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 49910 event pairs, 96 based on Foata normal form. 2/4292 useless extension candidates. Maximal degree in co-relation 5280. Up to 471 conditions per place. [2025-03-04 06:52:53,088 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-03-04 06:52:53,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 371 transitions, 898 flow [2025-03-04 06:52:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-03-04 06:52:53,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-03-04 06:52:53,091 INFO L175 Difference]: Start difference. First operand has 365 places, 370 transitions, 866 flow. Second operand 3 states and 1185 transitions. [2025-03-04 06:52:53,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 371 transitions, 898 flow [2025-03-04 06:52:53,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 371 transitions, 898 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:53,096 INFO L231 Difference]: Finished difference. Result has 366 places, 369 transitions, 868 flow [2025-03-04 06:52:53,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=364, 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=868, PETRI_PLACES=366, PETRI_TRANSITIONS=369} [2025-03-04 06:52:53,096 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2025-03-04 06:52:53,096 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 369 transitions, 868 flow [2025-03-04 06:52:53,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:53,097 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:53,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:52:53,097 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:53,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1172524175, now seen corresponding path program 1 times [2025-03-04 06:52:53,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:53,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987865099] [2025-03-04 06:52:53,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:53,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:53,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 06:52:53,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 06:52:53,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:53,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:53,135 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,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:53,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987865099] [2025-03-04 06:52:53,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987865099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:53,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:53,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:53,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933501154] [2025-03-04 06:52:53,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:53,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:53,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:53,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:53,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 412 [2025-03-04 06:52:53,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 369 transitions, 868 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:53,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 412 [2025-03-04 06:52:53,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:53,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1068] thread3EXIT-->L82-5: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][346], [120#L82-5true, 437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 473#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,681 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-04 06:52:53,681 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 06:52:53,681 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-04 06:52:53,681 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 06:52:53,684 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1068] thread3EXIT-->L82-5: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][346], [120#L82-5true, 437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 473#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:53,684 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2025-03-04 06:52:53,684 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-04 06:52:53,684 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-04 06:52:53,684 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-04 06:52:53,685 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-04 06:52:53,686 INFO L124 PetriNetUnfolderBase]: 193/5368 cut-off events. [2025-03-04 06:52:53,686 INFO L125 PetriNetUnfolderBase]: For 21/57 co-relation queries the response was YES. [2025-03-04 06:52:53,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6347 conditions, 5368 events. 193/5368 cut-off events. For 21/57 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 56590 event pairs, 6 based on Foata normal form. 0/5015 useless extension candidates. Maximal degree in co-relation 5679. Up to 147 conditions per place. [2025-03-04 06:52:53,749 INFO L140 encePairwiseOnDemand]: 410/412 looper letters, 8 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2025-03-04 06:52:53,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 368 transitions, 884 flow [2025-03-04 06:52:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2025-03-04 06:52:53,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2025-03-04 06:52:53,751 INFO L175 Difference]: Start difference. First operand has 366 places, 369 transitions, 868 flow. Second operand 3 states and 1189 transitions. [2025-03-04 06:52:53,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 368 transitions, 884 flow [2025-03-04 06:52:53,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 368 transitions, 880 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:53,760 INFO L231 Difference]: Finished difference. Result has 365 places, 368 transitions, 864 flow [2025-03-04 06:52:53,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=365, PETRI_TRANSITIONS=368} [2025-03-04 06:52:53,761 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-04 06:52:53,761 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 368 transitions, 864 flow [2025-03-04 06:52:53,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:53,761 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, 1, 1] [2025-03-04 06:52:53,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:52:53,762 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:53,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:53,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1807594392, now seen corresponding path program 1 times [2025-03-04 06:52:53,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:53,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704004231] [2025-03-04 06:52:53,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:53,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:53,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 06:52:53,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 06:52:53,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:53,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:53,815 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,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:53,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704004231] [2025-03-04 06:52:53,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704004231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:53,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:53,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:53,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359375658] [2025-03-04 06:52:53,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:53,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:53,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:53,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:53,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-04 06:52:53,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 368 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 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,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:53,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-04 06:52:53,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:54,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1068] thread3EXIT-->L82-5: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][346], [120#L82-5true, 437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:54,292 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2025-03-04 06:52:54,292 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-04 06:52:54,292 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-04 06:52:54,292 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-04 06:52:54,293 INFO L124 PetriNetUnfolderBase]: 199/5682 cut-off events. [2025-03-04 06:52:54,293 INFO L125 PetriNetUnfolderBase]: For 21/68 co-relation queries the response was YES. [2025-03-04 06:52:54,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6506 conditions, 5682 events. 199/5682 cut-off events. For 21/68 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 61231 event pairs, 18 based on Foata normal form. 0/5317 useless extension candidates. Maximal degree in co-relation 6206. Up to 166 conditions per place. [2025-03-04 06:52:54,330 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 10 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2025-03-04 06:52:54,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 366 transitions, 882 flow [2025-03-04 06:52:54,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1183 transitions. [2025-03-04 06:52:54,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571197411003236 [2025-03-04 06:52:54,332 INFO L175 Difference]: Start difference. First operand has 365 places, 368 transitions, 864 flow. Second operand 3 states and 1183 transitions. [2025-03-04 06:52:54,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 366 transitions, 882 flow [2025-03-04 06:52:54,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 366 transitions, 881 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:52:54,336 INFO L231 Difference]: Finished difference. Result has 364 places, 366 transitions, 861 flow [2025-03-04 06:52:54,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=364, PETRI_TRANSITIONS=366} [2025-03-04 06:52:54,336 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-03-04 06:52:54,337 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 366 transitions, 861 flow [2025-03-04 06:52:54,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 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,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:54,337 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, 1, 1, 1, 1] [2025-03-04 06:52:54,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:52:54,337 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-04 06:52:54,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash -609617814, now seen corresponding path program 1 times [2025-03-04 06:52:54,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:54,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400133025] [2025-03-04 06:52:54,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:54,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:54,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 06:52:54,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 06:52:54,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:54,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:54,375 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,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:54,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400133025] [2025-03-04 06:52:54,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400133025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:54,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:54,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:54,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882435982] [2025-03-04 06:52:54,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:54,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:54,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:54,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:54,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:54,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-04 06:52:54,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 366 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 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,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:54,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-04 06:52:54,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:54,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L56-7-->L56-5: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet18#1_3| |v_#race~result_11~0_3|) InVars {thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][234], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 298#L56-5true, Black: 450#true, 479#true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, Black: 431#true, 458#true, Black: 465#true, Black: 435#true, 482#true, 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 98#L80true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:54,651 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-03-04 06:52:54,651 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-03-04 06:52:54,652 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-03-04 06:52:54,652 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-03-04 06:52:54,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L56-7-->L56-5: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet18#1_3| |v_#race~result_11~0_3|) InVars {thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][234], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 298#L56-5true, 456#(= |#race~filename_1~0| 0), Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:54,686 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-04 06:52:54,686 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,686 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,687 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L56-7-->L56-5: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet18#1_3| |v_#race~result_11~0_3|) InVars {thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][234], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), 298#L56-5true, Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 482#true, Black: 469#true, 471#(= |#race~filename_7~0| 0), 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 98#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:54,703 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1004] L56-7-->L56-5: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet18#1_3| |v_#race~result_11~0_3|) InVars {thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][234], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), 298#L56-5true, Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 98#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:54,703 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][302], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), 298#L56-5true, Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:54,703 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,703 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:54,704 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][302], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), 298#L56-5true, Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), 98#L80true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:54,704 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-04 06:52:54,704 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,704 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,704 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:52:54,704 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 06:52:54,706 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1004] L56-7-->L56-5: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet18#1_3| |v_#race~result_11~0_3|) InVars {thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][234], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= |#race~is_null_6~0| 0), 456#(= |#race~filename_1~0| 0), 298#L56-5true, Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 458#true, 460#(= |#race~filename_4~0| 0), Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= 0 |#race~filename_is_null_5~0|), Black: 439#true, 98#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-04 06:52:54,706 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event [2025-03-04 06:52:54,707 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-03-04 06:52:54,707 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is not cut-off event [2025-03-04 06:52:54,707 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-03-04 06:52:54,707 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2025-03-04 06:52:54,707 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2025-03-04 06:52:54,707 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-03-04 06:52:54,748 INFO L124 PetriNetUnfolderBase]: 203/4061 cut-off events. [2025-03-04 06:52:54,748 INFO L125 PetriNetUnfolderBase]: For 63/114 co-relation queries the response was YES. [2025-03-04 06:52:54,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4815 conditions, 4061 events. 203/4061 cut-off events. For 63/114 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 41155 event pairs, 48 based on Foata normal form. 12/3785 useless extension candidates. Maximal degree in co-relation 4647. Up to 248 conditions per place. [2025-03-04 06:52:54,765 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2025-03-04 06:52:54,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 364 transitions, 877 flow [2025-03-04 06:52:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-03-04 06:52:54,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2025-03-04 06:52:54,767 INFO L175 Difference]: Start difference. First operand has 364 places, 366 transitions, 861 flow. Second operand 3 states and 1182 transitions. [2025-03-04 06:52:54,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 364 transitions, 877 flow [2025-03-04 06:52:54,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 364 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:52:54,770 INFO L231 Difference]: Finished difference. Result has 363 places, 0 transitions, 0 flow [2025-03-04 06:52:54,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=363, PETRI_TRANSITIONS=0} [2025-03-04 06:52:54,770 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -17 predicate places. [2025-03-04 06:52:54,770 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 0 transitions, 0 flow [2025-03-04 06:52:54,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 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,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-03-04 06:52:54,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-03-04 06:52:54,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-03-04 06:52:54,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-03-04 06:52:54,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:52:54,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:54,779 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:52:54,779 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:52:54,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:52:54 BasicIcfg [2025-03-04 06:52:54,782 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:52:54,782 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:52:54,782 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:52:54,783 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:52:54,783 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:45" (3/4) ... [2025-03-04 06:52:54,784 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:52:54,786 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:52:54,786 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:52:54,786 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:52:54,789 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 06:52:54,789 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:52:54,789 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:52:54,789 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:52:54,848 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:52:54,849 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:52:54,849 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:52:54,850 INFO L158 Benchmark]: Toolchain (without parser) took 9930.02ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 128.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 142.6MB. Max. memory is 16.1GB. [2025-03-04 06:52:54,850 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:52:54,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.94ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 116.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:54,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.46ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 114.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:54,850 INFO L158 Benchmark]: Boogie Preprocessor took 29.04ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 112.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:52:54,850 INFO L158 Benchmark]: IcfgBuilder took 487.47ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 85.9MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:52:54,850 INFO L158 Benchmark]: TraceAbstraction took 9089.30ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 85.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 536.9MB. Max. memory is 16.1GB. [2025-03-04 06:52:54,851 INFO L158 Benchmark]: Witness Printer took 66.44ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:54,853 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.94ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 116.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.46ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 114.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.04ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 112.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 487.47ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 85.9MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9089.30ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 85.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 536.9MB. Max. memory is 16.1GB. * Witness Printer took 66.44ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB 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: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: 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, 620 locations, 71 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: 8.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 522 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 662 IncrementalHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 114 mSDtfsCounter, 662 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.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred 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, 2446 NumberOfCodeBlocks, 2446 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2422 ConstructedInterpolants, 0 QuantifiedInterpolants, 2470 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 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:52:54,865 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