./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/parallel-min-max-1.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 bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:13:06,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:13:06,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:13:06,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:13:06,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:13:06,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:13:06,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:13:06,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:13:06,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:13:06,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:13:06,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:13:06,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:13:06,229 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:13:06,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:13:06,230 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:13:06,231 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:06,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:13:06,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:13:06,231 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 -> bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 [2025-03-17 11:13:06,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:13:06,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:13:06,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:13:06,465 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:13:06,465 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:13:06,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-03-17 11:13:07,608 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99018da19/4f28a61124154cd7add092c4b890e02b/FLAG1b066f0bc [2025-03-17 11:13:07,882 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:13:07,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-03-17 11:13:07,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99018da19/4f28a61124154cd7add092c4b890e02b/FLAG1b066f0bc [2025-03-17 11:13:08,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99018da19/4f28a61124154cd7add092c4b890e02b [2025-03-17 11:13:08,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:13:08,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:13:08,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:08,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:13:08,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:13:08,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778909ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08, skipping insertion in model container [2025-03-17 11:13:08,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:13:08,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:08,346 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:13:08,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:08,383 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:13:08,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08 WrapperNode [2025-03-17 11:13:08,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:08,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:08,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:13:08,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:13:08,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,411 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 137 [2025-03-17 11:13:08,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:08,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:13:08,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:13:08,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:13:08,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,427 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:13:08,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:13:08,433 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:13:08,433 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:13:08,437 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (1/1) ... [2025-03-17 11:13:08,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:08,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:13:08,469 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-17 11:13:08,471 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-17 11:13:08,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:13:08,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:13:08,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:13:08,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:13:08,492 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:13:08,492 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:13:08,492 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:13:08,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:13:08,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:13:08,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:13:08,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:13:08,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:13:08,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:13:08,493 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:13:08,576 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:13:08,577 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:13:08,883 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:13:08,883 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:13:08,907 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:13:08,908 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:13:08,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:08 BoogieIcfgContainer [2025-03-17 11:13:08,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:13:08,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:13:08,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:13:08,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:13:08,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:13:08" (1/3) ... [2025-03-17 11:13:08,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d026ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:08, skipping insertion in model container [2025-03-17 11:13:08,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:08" (2/3) ... [2025-03-17 11:13:08,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d026ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:08, skipping insertion in model container [2025-03-17 11:13:08,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:08" (3/3) ... [2025-03-17 11:13:08,916 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2025-03-17 11:13:08,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:13:08,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-min-max-1.wvr.c that has 4 procedures, 257 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-03-17 11:13:08,928 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:13:09,003 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:13:09,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 267 transitions, 555 flow [2025-03-17 11:13:09,128 INFO L124 PetriNetUnfolderBase]: 11/264 cut-off events. [2025-03-17 11:13:09,129 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:13:09,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 264 events. 11/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 390 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2025-03-17 11:13:09,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 267 transitions, 555 flow [2025-03-17 11:13:09,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 246 transitions, 504 flow [2025-03-17 11:13:09,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:13:09,164 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;@5a911539, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:13:09,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-17 11:13:09,182 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:13:09,182 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events. [2025-03-17 11:13:09,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:13:09,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:09,184 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] [2025-03-17 11:13:09,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:13:09,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1107108512, now seen corresponding path program 1 times [2025-03-17 11:13:09,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:09,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429291792] [2025-03-17 11:13:09,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:09,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:09,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 11:13:09,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 11:13:09,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:09,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:09,957 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-17 11:13:09,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:09,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429291792] [2025-03-17 11:13:09,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429291792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:09,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:09,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:13:09,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898988204] [2025-03-17 11:13:09,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:09,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:13:09,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:09,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:13:09,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:13:10,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 267 [2025-03-17 11:13:10,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 246 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 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-17 11:13:10,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:10,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 267 [2025-03-17 11:13:10,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:10,792 INFO L124 PetriNetUnfolderBase]: 1383/4225 cut-off events. [2025-03-17 11:13:10,793 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2025-03-17 11:13:10,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 4225 events. 1383/4225 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 34598 event pairs, 1142 based on Foata normal form. 4/3651 useless extension candidates. Maximal degree in co-relation 6654. Up to 2122 conditions per place. [2025-03-17 11:13:10,828 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 53 selfloop transitions, 5 changer transitions 4/241 dead transitions. [2025-03-17 11:13:10,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 241 transitions, 610 flow [2025-03-17 11:13:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:13:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:13:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1263 transitions. [2025-03-17 11:13:10,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7883895131086143 [2025-03-17 11:13:10,849 INFO L175 Difference]: Start difference. First operand has 246 places, 246 transitions, 504 flow. Second operand 6 states and 1263 transitions. [2025-03-17 11:13:10,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 241 transitions, 610 flow [2025-03-17 11:13:10,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 241 transitions, 604 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:13:10,859 INFO L231 Difference]: Finished difference. Result has 246 places, 237 transitions, 490 flow [2025-03-17 11:13:10,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=246, PETRI_TRANSITIONS=237} [2025-03-17 11:13:10,865 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 0 predicate places. [2025-03-17 11:13:10,866 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 237 transitions, 490 flow [2025-03-17 11:13:10,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 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-17 11:13:10,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:10,867 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] [2025-03-17 11:13:10,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:13:10,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:13:10,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1999846706, now seen corresponding path program 1 times [2025-03-17 11:13:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330193927] [2025-03-17 11:13:10,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:10,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 11:13:10,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 11:13:10,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:10,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:10,923 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-17 11:13:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330193927] [2025-03-17 11:13:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330193927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:10,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833949359] [2025-03-17 11:13:10,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:10,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:10,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:10,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:10,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:10,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 267 [2025-03-17 11:13:10,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 237 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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-17 11:13:10,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:10,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 267 [2025-03-17 11:13:10,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:11,181 INFO L124 PetriNetUnfolderBase]: 273/1656 cut-off events. [2025-03-17 11:13:11,181 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 11:13:11,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 1656 events. 273/1656 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 11731 event pairs, 185 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 2146. Up to 402 conditions per place. [2025-03-17 11:13:11,188 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 27 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2025-03-17 11:13:11,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 236 transitions, 546 flow [2025-03-17 11:13:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-17 11:13:11,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8913857677902621 [2025-03-17 11:13:11,190 INFO L175 Difference]: Start difference. First operand has 246 places, 237 transitions, 490 flow. Second operand 3 states and 714 transitions. [2025-03-17 11:13:11,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 236 transitions, 546 flow [2025-03-17 11:13:11,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 236 transitions, 536 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:13:11,193 INFO L231 Difference]: Finished difference. Result has 238 places, 236 transitions, 482 flow [2025-03-17 11:13:11,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=238, PETRI_TRANSITIONS=236} [2025-03-17 11:13:11,194 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -8 predicate places. [2025-03-17 11:13:11,194 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 236 transitions, 482 flow [2025-03-17 11:13:11,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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-17 11:13:11,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:11,195 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] [2025-03-17 11:13:11,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:13:11,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:13:11,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:11,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1355754659, now seen corresponding path program 1 times [2025-03-17 11:13:11,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:11,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602410462] [2025-03-17 11:13:11,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:11,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:11,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 11:13:11,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 11:13:11,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:11,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:11,226 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-17 11:13:11,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:11,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602410462] [2025-03-17 11:13:11,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602410462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:11,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:11,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:11,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182880300] [2025-03-17 11:13:11,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:11,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:11,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:11,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:11,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:11,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 267 [2025-03-17 11:13:11,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 236 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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-17 11:13:11,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:11,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 267 [2025-03-17 11:13:11,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:11,477 INFO L124 PetriNetUnfolderBase]: 559/2553 cut-off events. [2025-03-17 11:13:11,477 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-03-17 11:13:11,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3586 conditions, 2553 events. 559/2553 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 19894 event pairs, 193 based on Foata normal form. 0/2258 useless extension candidates. Maximal degree in co-relation 3479. Up to 821 conditions per place. [2025-03-17 11:13:11,486 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 35 selfloop transitions, 3 changer transitions 0/235 dead transitions. [2025-03-17 11:13:11,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 235 transitions, 561 flow [2025-03-17 11:13:11,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-17 11:13:11,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8801498127340824 [2025-03-17 11:13:11,488 INFO L175 Difference]: Start difference. First operand has 238 places, 236 transitions, 482 flow. Second operand 3 states and 705 transitions. [2025-03-17 11:13:11,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 235 transitions, 561 flow [2025-03-17 11:13:11,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 235 transitions, 557 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:11,492 INFO L231 Difference]: Finished difference. Result has 232 places, 231 transitions, 481 flow [2025-03-17 11:13:11,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=232, PETRI_TRANSITIONS=231} [2025-03-17 11:13:11,493 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -14 predicate places. [2025-03-17 11:13:11,493 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 231 transitions, 481 flow [2025-03-17 11:13:11,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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-17 11:13:11,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:11,494 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] [2025-03-17 11:13:11,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:13:11,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:13:11,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:11,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1342359559, now seen corresponding path program 1 times [2025-03-17 11:13:11,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:11,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437034686] [2025-03-17 11:13:11,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:11,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:11,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 11:13:11,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 11:13:11,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:11,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:11,745 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-17 11:13:11,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:11,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437034686] [2025-03-17 11:13:11,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437034686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:11,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:11,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:13:11,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739293877] [2025-03-17 11:13:11,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:11,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:13:11,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:11,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:13:11,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:13:12,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 267 [2025-03-17 11:13:12,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 231 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 220.16666666666666) internal successors, (1321), 6 states have internal predecessors, (1321), 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-17 11:13:12,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:12,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 267 [2025-03-17 11:13:12,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:12,273 INFO L124 PetriNetUnfolderBase]: 569/2658 cut-off events. [2025-03-17 11:13:12,273 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-17 11:13:12,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 2658 events. 569/2658 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 21708 event pairs, 129 based on Foata normal form. 0/2412 useless extension candidates. Maximal degree in co-relation 2936. Up to 714 conditions per place. [2025-03-17 11:13:12,284 INFO L140 encePairwiseOnDemand]: 252/267 looper letters, 59 selfloop transitions, 12 changer transitions 0/261 dead transitions. [2025-03-17 11:13:12,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 261 transitions, 700 flow [2025-03-17 11:13:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:13:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:13:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-03-17 11:13:12,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8626716604244694 [2025-03-17 11:13:12,288 INFO L175 Difference]: Start difference. First operand has 232 places, 231 transitions, 481 flow. Second operand 6 states and 1382 transitions. [2025-03-17 11:13:12,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 261 transitions, 700 flow [2025-03-17 11:13:12,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 261 transitions, 700 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:13:12,292 INFO L231 Difference]: Finished difference. Result has 238 places, 236 transitions, 552 flow [2025-03-17 11:13:12,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=238, PETRI_TRANSITIONS=236} [2025-03-17 11:13:12,292 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -8 predicate places. [2025-03-17 11:13:12,293 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 236 transitions, 552 flow [2025-03-17 11:13:12,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 220.16666666666666) internal successors, (1321), 6 states have internal predecessors, (1321), 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-17 11:13:12,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:12,293 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-17 11:13:12,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:13:12,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:13:12,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:12,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1913628579, now seen corresponding path program 1 times [2025-03-17 11:13:12,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:12,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751764498] [2025-03-17 11:13:12,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:12,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:13:12,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:13:12,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:12,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:12,432 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-17 11:13:12,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751764498] [2025-03-17 11:13:12,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751764498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:12,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:12,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:13:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835843537] [2025-03-17 11:13:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:12,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:13:12,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:12,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:13:12,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:13:12,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 267 [2025-03-17 11:13:12,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 236 transitions, 552 flow. Second operand has 7 states, 7 states have (on average 230.85714285714286) internal successors, (1616), 7 states have internal predecessors, (1616), 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-17 11:13:12,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:12,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 267 [2025-03-17 11:13:12,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:13,014 INFO L124 PetriNetUnfolderBase]: 446/2977 cut-off events. [2025-03-17 11:13:13,015 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2025-03-17 11:13:13,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4030 conditions, 2977 events. 446/2977 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 25138 event pairs, 262 based on Foata normal form. 17/2644 useless extension candidates. Maximal degree in co-relation 1742. Up to 388 conditions per place. [2025-03-17 11:13:13,037 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 40 selfloop transitions, 14 changer transitions 0/259 dead transitions. [2025-03-17 11:13:13,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 259 transitions, 716 flow [2025-03-17 11:13:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:13:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:13:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2335 transitions. [2025-03-17 11:13:13,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8745318352059925 [2025-03-17 11:13:13,042 INFO L175 Difference]: Start difference. First operand has 238 places, 236 transitions, 552 flow. Second operand 10 states and 2335 transitions. [2025-03-17 11:13:13,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 259 transitions, 716 flow [2025-03-17 11:13:13,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 259 transitions, 716 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:13:13,047 INFO L231 Difference]: Finished difference. Result has 251 places, 243 transitions, 618 flow [2025-03-17 11:13:13,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=618, PETRI_PLACES=251, PETRI_TRANSITIONS=243} [2025-03-17 11:13:13,048 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 5 predicate places. [2025-03-17 11:13:13,048 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 243 transitions, 618 flow [2025-03-17 11:13:13,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.85714285714286) internal successors, (1616), 7 states have internal predecessors, (1616), 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-17 11:13:13,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:13,049 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-17 11:13:13,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:13:13,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:13:13,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash 969238038, now seen corresponding path program 1 times [2025-03-17 11:13:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:13,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768049309] [2025-03-17 11:13:13,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:13,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:13,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:13:13,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:13:13,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:13,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:13,207 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-17 11:13:13,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:13,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768049309] [2025-03-17 11:13:13,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768049309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:13,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:13,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:13:13,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419146999] [2025-03-17 11:13:13,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:13,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:13:13,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:13,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:13:13,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:13:13,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 267 [2025-03-17 11:13:13,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 243 transitions, 618 flow. Second operand has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 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-17 11:13:13,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:13,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 267 [2025-03-17 11:13:13,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:13,691 INFO L124 PetriNetUnfolderBase]: 447/2504 cut-off events. [2025-03-17 11:13:13,691 INFO L125 PetriNetUnfolderBase]: For 79/85 co-relation queries the response was YES. [2025-03-17 11:13:13,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 2504 events. 447/2504 cut-off events. For 79/85 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 20238 event pairs, 291 based on Foata normal form. 26/2343 useless extension candidates. Maximal degree in co-relation 2966. Up to 483 conditions per place. [2025-03-17 11:13:13,704 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 24 selfloop transitions, 8 changer transitions 22/259 dead transitions. [2025-03-17 11:13:13,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 259 transitions, 763 flow [2025-03-17 11:13:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:13:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:13:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2333 transitions. [2025-03-17 11:13:13,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8737827715355805 [2025-03-17 11:13:13,708 INFO L175 Difference]: Start difference. First operand has 251 places, 243 transitions, 618 flow. Second operand 10 states and 2333 transitions. [2025-03-17 11:13:13,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 259 transitions, 763 flow [2025-03-17 11:13:13,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 259 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:13,714 INFO L231 Difference]: Finished difference. Result has 261 places, 237 transitions, 606 flow [2025-03-17 11:13:13,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=606, PETRI_PLACES=261, PETRI_TRANSITIONS=237} [2025-03-17 11:13:13,716 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 15 predicate places. [2025-03-17 11:13:13,717 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 237 transitions, 606 flow [2025-03-17 11:13:13,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 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-17 11:13:13,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:13,718 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] [2025-03-17 11:13:13,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:13:13,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:13:13,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1122017802, now seen corresponding path program 1 times [2025-03-17 11:13:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:13,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708025934] [2025-03-17 11:13:13,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:13,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 11:13:13,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 11:13:13,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:13,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:13:14,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:14,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708025934] [2025-03-17 11:13:14,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708025934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:14,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:14,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:13:14,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471031157] [2025-03-17 11:13:14,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:14,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:13:14,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:14,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:13:14,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:13:14,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 267 [2025-03-17 11:13:14,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 237 transitions, 606 flow. Second operand has 6 states, 6 states have (on average 224.5) internal successors, (1347), 6 states have internal predecessors, (1347), 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-17 11:13:14,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:14,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 267 [2025-03-17 11:13:14,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:14,607 INFO L124 PetriNetUnfolderBase]: 467/1937 cut-off events. [2025-03-17 11:13:14,607 INFO L125 PetriNetUnfolderBase]: For 60/67 co-relation queries the response was YES. [2025-03-17 11:13:14,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1937 events. 467/1937 cut-off events. For 60/67 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 14296 event pairs, 141 based on Foata normal form. 0/1747 useless extension candidates. Maximal degree in co-relation 2953. Up to 342 conditions per place. [2025-03-17 11:13:14,617 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 55 selfloop transitions, 5 changer transitions 0/259 dead transitions. [2025-03-17 11:13:14,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 259 transitions, 786 flow [2025-03-17 11:13:14,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:13:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:13:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1388 transitions. [2025-03-17 11:13:14,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8664169787765293 [2025-03-17 11:13:14,620 INFO L175 Difference]: Start difference. First operand has 261 places, 237 transitions, 606 flow. Second operand 6 states and 1388 transitions. [2025-03-17 11:13:14,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 259 transitions, 786 flow [2025-03-17 11:13:14,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 259 transitions, 742 flow, removed 7 selfloop flow, removed 13 redundant places. [2025-03-17 11:13:14,624 INFO L231 Difference]: Finished difference. Result has 243 places, 235 transitions, 568 flow [2025-03-17 11:13:14,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=568, PETRI_PLACES=243, PETRI_TRANSITIONS=235} [2025-03-17 11:13:14,625 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -3 predicate places. [2025-03-17 11:13:14,625 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 235 transitions, 568 flow [2025-03-17 11:13:14,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.5) internal successors, (1347), 6 states have internal predecessors, (1347), 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-17 11:13:14,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:14,626 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] [2025-03-17 11:13:14,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:13:14,626 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:13:14,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:14,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1839607255, now seen corresponding path program 1 times [2025-03-17 11:13:14,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:14,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586628059] [2025-03-17 11:13:14,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:14,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:14,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 11:13:14,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 11:13:14,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:14,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:13:14,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:14,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586628059] [2025-03-17 11:13:14,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586628059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:14,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:14,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:13:14,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102380905] [2025-03-17 11:13:14,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:14,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:13:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:14,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:13:14,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:13:15,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 267 [2025-03-17 11:13:15,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 235 transitions, 568 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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-17 11:13:15,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:15,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 267 [2025-03-17 11:13:15,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:15,453 INFO L124 PetriNetUnfolderBase]: 633/2100 cut-off events. [2025-03-17 11:13:15,453 INFO L125 PetriNetUnfolderBase]: For 76/79 co-relation queries the response was YES. [2025-03-17 11:13:15,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 2100 events. 633/2100 cut-off events. For 76/79 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 15937 event pairs, 169 based on Foata normal form. 0/1979 useless extension candidates. Maximal degree in co-relation 3475. Up to 477 conditions per place. [2025-03-17 11:13:15,460 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 0 selfloop transitions, 0 changer transitions 257/257 dead transitions. [2025-03-17 11:13:15,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 257 transitions, 744 flow [2025-03-17 11:13:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:13:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:13:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1388 transitions. [2025-03-17 11:13:15,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8664169787765293 [2025-03-17 11:13:15,465 INFO L175 Difference]: Start difference. First operand has 243 places, 235 transitions, 568 flow. Second operand 6 states and 1388 transitions. [2025-03-17 11:13:15,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 257 transitions, 744 flow [2025-03-17 11:13:15,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 257 transitions, 734 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:13:15,468 INFO L231 Difference]: Finished difference. Result has 241 places, 0 transitions, 0 flow [2025-03-17 11:13:15,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=241, PETRI_TRANSITIONS=0} [2025-03-17 11:13:15,470 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -5 predicate places. [2025-03-17 11:13:15,470 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 0 transitions, 0 flow [2025-03-17 11:13:15,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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-17 11:13:15,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (30 of 31 remaining) [2025-03-17 11:13:15,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-03-17 11:13:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-03-17 11:13:15,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-03-17 11:13:15,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:13:15,476 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:15,480 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:13:15,480 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:13:15,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:13:15 BasicIcfg [2025-03-17 11:13:15,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:13:15,486 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:13:15,486 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:13:15,486 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:13:15,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:08" (3/4) ... [2025-03-17 11:13:15,487 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:13:15,489 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:13:15,489 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:13:15,490 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:13:15,492 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 11:13:15,492 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:13:15,492 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 11:13:15,492 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:13:15,547 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:13:15,548 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:13:15,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:13:15,549 INFO L158 Benchmark]: Toolchain (without parser) took 7353.43ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 106.1MB in the beginning and 463.7MB in the end (delta: -357.5MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2025-03-17 11:13:15,549 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:15,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.07ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.8MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:13:15,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.06ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:15,552 INFO L158 Benchmark]: Boogie Preprocessor took 20.44ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:15,553 INFO L158 Benchmark]: IcfgBuilder took 475.40ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 63.5MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 11:13:15,553 INFO L158 Benchmark]: TraceAbstraction took 6575.51ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 63.5MB in the beginning and 472.0MB in the end (delta: -408.5MB). Peak memory consumption was 376.7MB. Max. memory is 16.1GB. [2025-03-17 11:13:15,553 INFO L158 Benchmark]: Witness Printer took 62.20ms. Allocated memory is still 604.0MB. Free memory was 472.0MB in the beginning and 463.7MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:15,554 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.07ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.8MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.06ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.44ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 475.40ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 63.5MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6575.51ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 63.5MB in the beginning and 472.0MB in the end (delta: -408.5MB). Peak memory consumption was 376.7MB. Max. memory is 16.1GB. * Witness Printer took 62.20ms. Allocated memory is still 604.0MB. Free memory was 472.0MB in the beginning and 463.7MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: 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: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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, 359 locations, 373 edges, 31 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: 6.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1351 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 852 mSDsluCounter, 647 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 504 mSDsCounter, 337 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2466 IncrementalHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 337 mSolverCounterUnsat, 143 mSDtfsCounter, 2466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=618occurred in iteration=5, InterpolantAutomatonStates: 50, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 836 NumberOfCodeBlocks, 836 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 828 ConstructedInterpolants, 0 QuantifiedInterpolants, 1522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4/4 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 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:13:15,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE