./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-outer-race.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-outer-race.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 9c1b6e7c1e8bfef4b5287f6721dfd9aa884edccd2d36385131f8c18349e78f1f --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:12:32,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:12:32,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:12:32,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:12:32,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:12:32,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:12:32,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:12:32,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:12:32,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:12:32,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:12:32,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:12:32,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:12:32,088 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:12:32,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:12:32,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:12:32,089 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:12:32,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:12:32,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:12:32,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:12:32,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:12:32,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:12:32,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:12:32,089 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:12:32,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:12:32,090 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:32,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:32,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:12:32,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:12:32,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:12:32,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:12:32,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:12:32,091 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 -> 9c1b6e7c1e8bfef4b5287f6721dfd9aa884edccd2d36385131f8c18349e78f1f [2025-04-29 11:12:32,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:12:32,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:12:32,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:12:32,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:12:32,319 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:12:32,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-outer-race.c [2025-04-29 11:12:33,614 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1827cbd0/8695ec0d7f88455f84bd3cf1765a5845/FLAGb04eba1a1 [2025-04-29 11:12:33,815 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:12:33,816 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-outer-race.c [2025-04-29 11:12:33,819 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:33,827 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1827cbd0/8695ec0d7f88455f84bd3cf1765a5845/FLAGb04eba1a1 [2025-04-29 11:12:34,664 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1827cbd0/8695ec0d7f88455f84bd3cf1765a5845 [2025-04-29 11:12:34,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:12:34,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:12:34,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:12:34,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:12:34,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:12:34,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2e639c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34, skipping insertion in model container [2025-04-29 11:12:34,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:12:34,843 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:12:34,852 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:12:34,875 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:12:34,887 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:12:34,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34 WrapperNode [2025-04-29 11:12:34,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:12:34,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:12:34,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:12:34,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:12:34,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,909 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2025-04-29 11:12:34,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:12:34,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:12:34,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:12:34,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:12:34,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:12:34,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:12:34,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:12:34,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:12:34,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (1/1) ... [2025-04-29 11:12:34,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:34,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:12:34,961 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-04-29 11:12:34,967 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-04-29 11:12:34,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:12:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:12:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:12:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:12:34,982 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:12:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:12:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:12:34,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:12:34,983 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:12:35,044 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:12:35,046 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:12:35,160 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:12:35,160 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:12:35,170 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:12:35,171 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:12:35,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:35 BoogieIcfgContainer [2025-04-29 11:12:35,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:12:35,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:12:35,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:12:35,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:12:35,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:12:34" (1/3) ... [2025-04-29 11:12:35,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e4f29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:12:35, skipping insertion in model container [2025-04-29 11:12:35,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:34" (2/3) ... [2025-04-29 11:12:35,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e4f29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:12:35, skipping insertion in model container [2025-04-29 11:12:35,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:35" (3/3) ... [2025-04-29 11:12:35,178 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race.c [2025-04-29 11:12:35,188 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:12:35,190 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race.c that has 2 procedures, 87 locations, 89 edges, 1 initial locations, 2 loop locations, and 7 error locations. [2025-04-29 11:12:35,190 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:12:35,228 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:12:35,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 90 transitions, 184 flow [2025-04-29 11:12:35,298 INFO L116 PetriNetUnfolderBase]: 5/121 cut-off events. [2025-04-29 11:12:35,300 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:35,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 121 events. 5/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 171 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 66. Up to 4 conditions per place. [2025-04-29 11:12:35,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 90 transitions, 184 flow [2025-04-29 11:12:35,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 90 transitions, 184 flow [2025-04-29 11:12:35,309 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:12:35,318 INFO L340 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;@4bb47482, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:12:35,318 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-29 11:12:35,324 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:12:35,324 INFO L116 PetriNetUnfolderBase]: 1/28 cut-off events. [2025-04-29 11:12:35,324 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:35,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:35,324 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] [2025-04-29 11:12:35,324 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:35,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash -831595093, now seen corresponding path program 1 times [2025-04-29 11:12:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:35,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715982338] [2025-04-29 11:12:35,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:35,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:12:35,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:12:35,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:35,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:35,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:35,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715982338] [2025-04-29 11:12:35,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715982338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:35,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:35,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:35,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749912647] [2025-04-29 11:12:35,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:35,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:35,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:35,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:35,498 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 90 [2025-04-29 11:12:35,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-04-29 11:12:35,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:35,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 90 [2025-04-29 11:12:35,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:35,588 INFO L116 PetriNetUnfolderBase]: 32/289 cut-off events. [2025-04-29 11:12:35,589 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:12:35,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 289 events. 32/289 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1187 event pairs, 7 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 310. Up to 59 conditions per place. [2025-04-29 11:12:35,593 INFO L140 encePairwiseOnDemand]: 77/90 looper letters, 16 selfloop transitions, 8 changer transitions 1/98 dead transitions. [2025-04-29 11:12:35,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 98 transitions, 248 flow [2025-04-29 11:12:35,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-04-29 11:12:35,605 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-04-29 11:12:35,606 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 184 flow. Second operand 3 states and 252 transitions. [2025-04-29 11:12:35,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 98 transitions, 248 flow [2025-04-29 11:12:35,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 98 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:35,616 INFO L231 Difference]: Finished difference. Result has 94 places, 95 transitions, 248 flow [2025-04-29 11:12:35,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=94, PETRI_TRANSITIONS=95} [2025-04-29 11:12:35,623 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-04-29 11:12:35,623 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 95 transitions, 248 flow [2025-04-29 11:12:35,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-04-29 11:12:35,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:35,624 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] [2025-04-29 11:12:35,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:12:35,626 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:35,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash -348762717, now seen corresponding path program 1 times [2025-04-29 11:12:35,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:35,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59672487] [2025-04-29 11:12:35,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:35,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:12:35,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:12:35,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:35,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:35,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:35,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59672487] [2025-04-29 11:12:35,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59672487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:35,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:35,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:35,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941596100] [2025-04-29 11:12:35,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:35,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:35,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:35,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:35,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:35,695 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 90 [2025-04-29 11:12:35,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 95 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-04-29 11:12:35,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:35,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 90 [2025-04-29 11:12:35,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:35,762 INFO L116 PetriNetUnfolderBase]: 27/304 cut-off events. [2025-04-29 11:12:35,763 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-29 11:12:35,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 304 events. 27/304 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1386 event pairs, 5 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 359. Up to 45 conditions per place. [2025-04-29 11:12:35,764 INFO L140 encePairwiseOnDemand]: 86/90 looper letters, 8 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2025-04-29 11:12:35,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 99 transitions, 278 flow [2025-04-29 11:12:35,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2025-04-29 11:12:35,766 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-04-29 11:12:35,766 INFO L175 Difference]: Start difference. First operand has 94 places, 95 transitions, 248 flow. Second operand 3 states and 255 transitions. [2025-04-29 11:12:35,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 99 transitions, 278 flow [2025-04-29 11:12:35,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 99 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:35,768 INFO L231 Difference]: Finished difference. Result has 95 places, 97 transitions, 254 flow [2025-04-29 11:12:35,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=95, PETRI_TRANSITIONS=97} [2025-04-29 11:12:35,769 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-04-29 11:12:35,769 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 97 transitions, 254 flow [2025-04-29 11:12:35,769 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-04-29 11:12:35,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:35,770 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] [2025-04-29 11:12:35,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:12:35,770 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:35,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1382986178, now seen corresponding path program 1 times [2025-04-29 11:12:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:35,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013169529] [2025-04-29 11:12:35,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:35,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:35,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:12:35,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:12:35,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:35,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:35,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:35,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013169529] [2025-04-29 11:12:35,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013169529] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:35,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:35,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:35,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566557958] [2025-04-29 11:12:35,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:35,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:35,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:35,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:35,866 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 90 [2025-04-29 11:12:35,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 97 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-04-29 11:12:35,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:35,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 90 [2025-04-29 11:12:35,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:35,924 INFO L116 PetriNetUnfolderBase]: 54/452 cut-off events. [2025-04-29 11:12:35,924 INFO L117 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2025-04-29 11:12:35,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 452 events. 54/452 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2508 event pairs, 23 based on Foata normal form. 4/412 useless extension candidates. Maximal degree in co-relation 627. Up to 104 conditions per place. [2025-04-29 11:12:35,928 INFO L140 encePairwiseOnDemand]: 84/90 looper letters, 19 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2025-04-29 11:12:35,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 104 transitions, 326 flow [2025-04-29 11:12:35,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2025-04-29 11:12:35,932 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-04-29 11:12:35,932 INFO L175 Difference]: Start difference. First operand has 95 places, 97 transitions, 254 flow. Second operand 3 states and 243 transitions. [2025-04-29 11:12:35,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 104 transitions, 326 flow [2025-04-29 11:12:35,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 104 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:35,934 INFO L231 Difference]: Finished difference. Result has 97 places, 102 transitions, 304 flow [2025-04-29 11:12:35,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=97, PETRI_TRANSITIONS=102} [2025-04-29 11:12:35,935 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2025-04-29 11:12:35,935 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 102 transitions, 304 flow [2025-04-29 11:12:35,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-04-29 11:12:35,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:35,935 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] [2025-04-29 11:12:35,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:12:35,935 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:35,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:35,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1725427048, now seen corresponding path program 1 times [2025-04-29 11:12:35,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:35,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303109564] [2025-04-29 11:12:35,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:35,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:35,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:12:35,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:12:35,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:35,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:35,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:35,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303109564] [2025-04-29 11:12:35,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303109564] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:35,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:35,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066272785] [2025-04-29 11:12:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:35,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:35,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:35,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:35,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:35,995 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 90 [2025-04-29 11:12:35,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 102 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-04-29 11:12:35,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:35,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 90 [2025-04-29 11:12:35,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:36,035 INFO L116 PetriNetUnfolderBase]: 36/361 cut-off events. [2025-04-29 11:12:36,035 INFO L117 PetriNetUnfolderBase]: For 63/70 co-relation queries the response was YES. [2025-04-29 11:12:36,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 361 events. 36/361 cut-off events. For 63/70 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1935 event pairs, 9 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 493. Up to 51 conditions per place. [2025-04-29 11:12:36,037 INFO L140 encePairwiseOnDemand]: 85/90 looper letters, 8 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2025-04-29 11:12:36,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 105 transitions, 338 flow [2025-04-29 11:12:36,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-04-29 11:12:36,039 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-04-29 11:12:36,040 INFO L175 Difference]: Start difference. First operand has 97 places, 102 transitions, 304 flow. Second operand 3 states and 250 transitions. [2025-04-29 11:12:36,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 105 transitions, 338 flow [2025-04-29 11:12:36,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 105 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:36,044 INFO L231 Difference]: Finished difference. Result has 99 places, 105 transitions, 326 flow [2025-04-29 11:12:36,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=99, PETRI_TRANSITIONS=105} [2025-04-29 11:12:36,044 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2025-04-29 11:12:36,044 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 105 transitions, 326 flow [2025-04-29 11:12:36,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-04-29 11:12:36,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:36,045 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] [2025-04-29 11:12:36,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:12:36,045 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:36,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:36,045 INFO L85 PathProgramCache]: Analyzing trace with hash -920306877, now seen corresponding path program 1 times [2025-04-29 11:12:36,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:36,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064667882] [2025-04-29 11:12:36,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:36,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:12:36,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:12:36,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:36,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:36,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:36,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064667882] [2025-04-29 11:12:36,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064667882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:36,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:36,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957831353] [2025-04-29 11:12:36,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:36,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:36,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:36,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:36,138 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 90 [2025-04-29 11:12:36,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 105 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-04-29 11:12:36,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:36,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 90 [2025-04-29 11:12:36,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:36,190 INFO L116 PetriNetUnfolderBase]: 64/475 cut-off events. [2025-04-29 11:12:36,191 INFO L117 PetriNetUnfolderBase]: For 160/168 co-relation queries the response was YES. [2025-04-29 11:12:36,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 475 events. 64/475 cut-off events. For 160/168 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2714 event pairs, 13 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 796. Up to 109 conditions per place. [2025-04-29 11:12:36,194 INFO L140 encePairwiseOnDemand]: 83/90 looper letters, 16 selfloop transitions, 11 changer transitions 1/112 dead transitions. [2025-04-29 11:12:36,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 112 transitions, 408 flow [2025-04-29 11:12:36,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2025-04-29 11:12:36,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9111111111111111 [2025-04-29 11:12:36,195 INFO L175 Difference]: Start difference. First operand has 99 places, 105 transitions, 326 flow. Second operand 3 states and 246 transitions. [2025-04-29 11:12:36,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 112 transitions, 408 flow [2025-04-29 11:12:36,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:36,200 INFO L231 Difference]: Finished difference. Result has 101 places, 111 transitions, 400 flow [2025-04-29 11:12:36,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=101, PETRI_TRANSITIONS=111} [2025-04-29 11:12:36,202 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 11 predicate places. [2025-04-29 11:12:36,202 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 111 transitions, 400 flow [2025-04-29 11:12:36,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-04-29 11:12:36,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:36,203 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] [2025-04-29 11:12:36,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:12:36,203 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:36,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:36,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1581096011, now seen corresponding path program 1 times [2025-04-29 11:12:36,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:36,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656491406] [2025-04-29 11:12:36,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:36,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:36,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:12:36,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:12:36,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:36,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:36,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:36,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656491406] [2025-04-29 11:12:36,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656491406] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:36,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319604474] [2025-04-29 11:12:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:36,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:12:36,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:36,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:12:36,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:12:36,383 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 90 [2025-04-29 11:12:36,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 111 transitions, 400 flow. Second operand has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 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-04-29 11:12:36,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:36,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 90 [2025-04-29 11:12:36,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:36,459 INFO L116 PetriNetUnfolderBase]: 68/455 cut-off events. [2025-04-29 11:12:36,460 INFO L117 PetriNetUnfolderBase]: For 236/244 co-relation queries the response was YES. [2025-04-29 11:12:36,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 455 events. 68/455 cut-off events. For 236/244 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2550 event pairs, 13 based on Foata normal form. 3/430 useless extension candidates. Maximal degree in co-relation 815. Up to 65 conditions per place. [2025-04-29 11:12:36,463 INFO L140 encePairwiseOnDemand]: 83/90 looper letters, 14 selfloop transitions, 7 changer transitions 1/115 dead transitions. [2025-04-29 11:12:36,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 115 transitions, 436 flow [2025-04-29 11:12:36,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 480 transitions. [2025-04-29 11:12:36,464 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-04-29 11:12:36,464 INFO L175 Difference]: Start difference. First operand has 101 places, 111 transitions, 400 flow. Second operand 6 states and 480 transitions. [2025-04-29 11:12:36,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 115 transitions, 436 flow [2025-04-29 11:12:36,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 115 transitions, 400 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-04-29 11:12:36,469 INFO L231 Difference]: Finished difference. Result has 101 places, 110 transitions, 378 flow [2025-04-29 11:12:36,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=378, PETRI_PLACES=101, PETRI_TRANSITIONS=110} [2025-04-29 11:12:36,470 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 11 predicate places. [2025-04-29 11:12:36,470 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 110 transitions, 378 flow [2025-04-29 11:12:36,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 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-04-29 11:12:36,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:36,471 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:36,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:12:36,471 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:36,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1670063810, now seen corresponding path program 1 times [2025-04-29 11:12:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:36,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195301472] [2025-04-29 11:12:36,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:36,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:36,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:12:36,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:12:36,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:36,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:36,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:12:36,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:12:36,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:12:36,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:36,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:36,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:12:36,521 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:12:36,522 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-04-29 11:12:36,523 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-04-29 11:12:36,524 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-04-29 11:12:36,524 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-04-29 11:12:36,524 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-04-29 11:12:36,524 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-04-29 11:12:36,524 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-04-29 11:12:36,524 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-04-29 11:12:36,524 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-04-29 11:12:36,524 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-04-29 11:12:36,525 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-04-29 11:12:36,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:12:36,525 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:36,529 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:12:36,530 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:12:36,542 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:12:36,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 118 transitions, 246 flow [2025-04-29 11:12:36,562 INFO L116 PetriNetUnfolderBase]: 7/188 cut-off events. [2025-04-29 11:12:36,563 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:12:36,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 188 events. 7/188 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 302 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 122. Up to 6 conditions per place. [2025-04-29 11:12:36,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 118 transitions, 246 flow [2025-04-29 11:12:36,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 118 transitions, 246 flow [2025-04-29 11:12:36,565 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:12:36,566 INFO L340 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;@4bb47482, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:12:36,566 INFO L341 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-04-29 11:12:36,569 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:12:36,569 INFO L116 PetriNetUnfolderBase]: 1/28 cut-off events. [2025-04-29 11:12:36,569 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:36,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:36,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:36,570 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:12:36,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:36,570 INFO L85 PathProgramCache]: Analyzing trace with hash -808823839, now seen corresponding path program 1 times [2025-04-29 11:12:36,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:36,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141342006] [2025-04-29 11:12:36,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:36,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:36,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:12:36,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:12:36,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:36,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:36,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:36,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141342006] [2025-04-29 11:12:36,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141342006] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:36,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000043168] [2025-04-29 11:12:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:36,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:36,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:36,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:36,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:36,622 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 118 [2025-04-29 11:12:36,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 118 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-04-29 11:12:36,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:36,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 118 [2025-04-29 11:12:36,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:36,825 INFO L116 PetriNetUnfolderBase]: 563/2341 cut-off events. [2025-04-29 11:12:36,825 INFO L117 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-04-29 11:12:36,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 2341 events. 563/2341 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 19515 event pairs, 195 based on Foata normal form. 1/2085 useless extension candidates. Maximal degree in co-relation 2679. Up to 666 conditions per place. [2025-04-29 11:12:36,841 INFO L140 encePairwiseOnDemand]: 101/118 looper letters, 26 selfloop transitions, 11 changer transitions 1/132 dead transitions. [2025-04-29 11:12:36,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 132 transitions, 353 flow [2025-04-29 11:12:36,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2025-04-29 11:12:36,844 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9293785310734464 [2025-04-29 11:12:36,844 INFO L175 Difference]: Start difference. First operand has 120 places, 118 transitions, 246 flow. Second operand 3 states and 329 transitions. [2025-04-29 11:12:36,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 132 transitions, 353 flow [2025-04-29 11:12:36,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 132 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:36,847 INFO L231 Difference]: Finished difference. Result has 124 places, 126 transitions, 336 flow [2025-04-29 11:12:36,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=124, PETRI_TRANSITIONS=126} [2025-04-29 11:12:36,847 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2025-04-29 11:12:36,848 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 126 transitions, 336 flow [2025-04-29 11:12:36,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-04-29 11:12:36,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:36,848 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] [2025-04-29 11:12:36,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:12:36,849 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:12:36,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1226253913, now seen corresponding path program 1 times [2025-04-29 11:12:36,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:36,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721261528] [2025-04-29 11:12:36,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:36,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:36,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:12:36,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:12:36,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:36,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:36,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:36,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721261528] [2025-04-29 11:12:36,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721261528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:36,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:36,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:36,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232201536] [2025-04-29 11:12:36,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:36,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:36,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:36,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:36,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:36,887 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 118 [2025-04-29 11:12:36,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 126 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-04-29 11:12:36,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:36,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 118 [2025-04-29 11:12:36,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:37,125 INFO L116 PetriNetUnfolderBase]: 487/2648 cut-off events. [2025-04-29 11:12:37,125 INFO L117 PetriNetUnfolderBase]: For 239/249 co-relation queries the response was YES. [2025-04-29 11:12:37,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4050 conditions, 2648 events. 487/2648 cut-off events. For 239/249 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 24816 event pairs, 174 based on Foata normal form. 0/2366 useless extension candidates. Maximal degree in co-relation 3290. Up to 500 conditions per place. [2025-04-29 11:12:37,137 INFO L140 encePairwiseOnDemand]: 113/118 looper letters, 14 selfloop transitions, 4 changer transitions 0/133 dead transitions. [2025-04-29 11:12:37,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 133 transitions, 386 flow [2025-04-29 11:12:37,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2025-04-29 11:12:37,139 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.943502824858757 [2025-04-29 11:12:37,139 INFO L175 Difference]: Start difference. First operand has 124 places, 126 transitions, 336 flow. Second operand 3 states and 334 transitions. [2025-04-29 11:12:37,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 133 transitions, 386 flow [2025-04-29 11:12:37,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 133 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:37,146 INFO L231 Difference]: Finished difference. Result has 125 places, 129 transitions, 344 flow [2025-04-29 11:12:37,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=125, PETRI_TRANSITIONS=129} [2025-04-29 11:12:37,147 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2025-04-29 11:12:37,147 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 129 transitions, 344 flow [2025-04-29 11:12:37,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-04-29 11:12:37,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:37,147 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] [2025-04-29 11:12:37,147 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:12:37,147 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:12:37,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1331105726, now seen corresponding path program 1 times [2025-04-29 11:12:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:37,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723587501] [2025-04-29 11:12:37,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:37,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:37,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:12:37,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:12:37,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:37,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:37,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:37,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723587501] [2025-04-29 11:12:37,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723587501] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:37,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:37,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:37,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452869174] [2025-04-29 11:12:37,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:37,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:37,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:37,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:37,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:37,197 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 118 [2025-04-29 11:12:37,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 129 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:37,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:37,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 118 [2025-04-29 11:12:37,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:37,316 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][31], [128#true, Black: 130#(= |#race~data~0| 0), 84#L23-3true, 133#true, Black: 123#true, 52#L27-2true, 121#true, 119#true, 10#L45-1true]) [2025-04-29 11:12:37,317 INFO L286 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-04-29 11:12:37,317 INFO L289 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-04-29 11:12:37,317 INFO L289 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-04-29 11:12:37,317 INFO L289 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-04-29 11:12:37,432 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][31], [128#true, Black: 130#(= |#race~data~0| 0), 86#L25-3true, 133#true, Black: 123#true, 52#L27-2true, 121#true, 10#L45-1true, 119#true]) [2025-04-29 11:12:37,432 INFO L286 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-04-29 11:12:37,432 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-29 11:12:37,432 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-29 11:12:37,432 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-29 11:12:37,608 INFO L116 PetriNetUnfolderBase]: 1078/4628 cut-off events. [2025-04-29 11:12:37,608 INFO L117 PetriNetUnfolderBase]: For 832/973 co-relation queries the response was YES. [2025-04-29 11:12:37,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7770 conditions, 4628 events. 1078/4628 cut-off events. For 832/973 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 46124 event pairs, 540 based on Foata normal form. 39/4069 useless extension candidates. Maximal degree in co-relation 6529. Up to 1374 conditions per place. [2025-04-29 11:12:37,640 INFO L140 encePairwiseOnDemand]: 110/118 looper letters, 28 selfloop transitions, 12 changer transitions 0/143 dead transitions. [2025-04-29 11:12:37,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 143 transitions, 468 flow [2025-04-29 11:12:37,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2025-04-29 11:12:37,642 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9067796610169492 [2025-04-29 11:12:37,642 INFO L175 Difference]: Start difference. First operand has 125 places, 129 transitions, 344 flow. Second operand 3 states and 321 transitions. [2025-04-29 11:12:37,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 143 transitions, 468 flow [2025-04-29 11:12:37,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 143 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:37,646 INFO L231 Difference]: Finished difference. Result has 127 places, 139 transitions, 442 flow [2025-04-29 11:12:37,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=127, PETRI_TRANSITIONS=139} [2025-04-29 11:12:37,648 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 7 predicate places. [2025-04-29 11:12:37,648 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 139 transitions, 442 flow [2025-04-29 11:12:37,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:37,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:37,649 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] [2025-04-29 11:12:37,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:12:37,649 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:12:37,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:37,650 INFO L85 PathProgramCache]: Analyzing trace with hash 595686749, now seen corresponding path program 1 times [2025-04-29 11:12:37,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:37,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598922053] [2025-04-29 11:12:37,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:37,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:37,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:12:37,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:12:37,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:37,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:37,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:37,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598922053] [2025-04-29 11:12:37,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598922053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:37,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:37,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:37,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615692877] [2025-04-29 11:12:37,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:37,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:37,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:37,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:37,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:37,693 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 118 [2025-04-29 11:12:37,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 139 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-04-29 11:12:37,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:37,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 118 [2025-04-29 11:12:37,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:37,943 INFO L116 PetriNetUnfolderBase]: 734/3774 cut-off events. [2025-04-29 11:12:37,943 INFO L117 PetriNetUnfolderBase]: For 962/1179 co-relation queries the response was YES. [2025-04-29 11:12:37,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6434 conditions, 3774 events. 734/3774 cut-off events. For 962/1179 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 38702 event pairs, 223 based on Foata normal form. 3/3309 useless extension candidates. Maximal degree in co-relation 4259. Up to 663 conditions per place. [2025-04-29 11:12:37,971 INFO L140 encePairwiseOnDemand]: 112/118 looper letters, 16 selfloop transitions, 7 changer transitions 0/147 dead transitions. [2025-04-29 11:12:37,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 147 transitions, 515 flow [2025-04-29 11:12:37,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2025-04-29 11:12:37,974 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9322033898305084 [2025-04-29 11:12:37,974 INFO L175 Difference]: Start difference. First operand has 127 places, 139 transitions, 442 flow. Second operand 3 states and 330 transitions. [2025-04-29 11:12:37,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 147 transitions, 515 flow [2025-04-29 11:12:37,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 147 transitions, 491 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:37,980 INFO L231 Difference]: Finished difference. Result has 129 places, 144 transitions, 474 flow [2025-04-29 11:12:37,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=129, PETRI_TRANSITIONS=144} [2025-04-29 11:12:37,981 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 9 predicate places. [2025-04-29 11:12:37,981 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 144 transitions, 474 flow [2025-04-29 11:12:37,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-04-29 11:12:37,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:37,982 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] [2025-04-29 11:12:37,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:12:37,982 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:12:37,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash 284862996, now seen corresponding path program 1 times [2025-04-29 11:12:37,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:37,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845506799] [2025-04-29 11:12:37,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:37,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:37,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:12:37,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:12:37,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:37,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:38,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:38,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845506799] [2025-04-29 11:12:38,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845506799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:38,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:38,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:38,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856501171] [2025-04-29 11:12:38,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:38,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:38,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:38,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:38,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:38,041 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 118 [2025-04-29 11:12:38,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 144 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-04-29 11:12:38,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:38,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 118 [2025-04-29 11:12:38,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:38,136 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][31], [Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 143#true, Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 138#true, Black: 130#(= |#race~data~0| 0), 84#L23-3true, Black: 123#true, 52#L27-2true, 121#true, 119#true, 10#L45-1true]) [2025-04-29 11:12:38,137 INFO L286 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-04-29 11:12:38,137 INFO L289 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-04-29 11:12:38,137 INFO L289 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-04-29 11:12:38,137 INFO L289 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-04-29 11:12:38,247 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][31], [Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 143#true, Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 138#true, Black: 130#(= |#race~data~0| 0), 86#L25-3true, Black: 123#true, 52#L27-2true, 121#true, 10#L45-1true, 119#true]) [2025-04-29 11:12:38,247 INFO L286 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-04-29 11:12:38,247 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-29 11:12:38,247 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-29 11:12:38,247 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-29 11:12:38,384 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][116], [Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 115#L27-7true, 143#true, Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 138#true, Black: 130#(= |#race~data~0| 0), 117#L27-2true, Black: 123#true, 121#true, 10#L45-1true, 119#true]) [2025-04-29 11:12:38,385 INFO L286 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-04-29 11:12:38,385 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-29 11:12:38,385 INFO L289 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-04-29 11:12:38,385 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-29 11:12:38,427 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][31], [Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 42#L28true, 143#true, Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 138#true, Black: 130#(= |#race~data~0| 0), 117#L27-2true, Black: 123#true, 121#true, 10#L45-1true, 119#true]) [2025-04-29 11:12:38,427 INFO L286 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-04-29 11:12:38,428 INFO L289 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-04-29 11:12:38,428 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:38,428 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:38,498 INFO L116 PetriNetUnfolderBase]: 1587/6313 cut-off events. [2025-04-29 11:12:38,498 INFO L117 PetriNetUnfolderBase]: For 3267/3514 co-relation queries the response was YES. [2025-04-29 11:12:38,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12388 conditions, 6313 events. 1587/6313 cut-off events. For 3267/3514 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 66490 event pairs, 516 based on Foata normal form. 46/5548 useless extension candidates. Maximal degree in co-relation 10314. Up to 1835 conditions per place. [2025-04-29 11:12:38,529 INFO L140 encePairwiseOnDemand]: 109/118 looper letters, 31 selfloop transitions, 19 changer transitions 0/162 dead transitions. [2025-04-29 11:12:38,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 162 transitions, 659 flow [2025-04-29 11:12:38,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:38,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2025-04-29 11:12:38,530 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9180790960451978 [2025-04-29 11:12:38,530 INFO L175 Difference]: Start difference. First operand has 129 places, 144 transitions, 474 flow. Second operand 3 states and 325 transitions. [2025-04-29 11:12:38,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 162 transitions, 659 flow [2025-04-29 11:12:38,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 162 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:38,534 INFO L231 Difference]: Finished difference. Result has 131 places, 159 transitions, 642 flow [2025-04-29 11:12:38,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=131, PETRI_TRANSITIONS=159} [2025-04-29 11:12:38,535 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 11 predicate places. [2025-04-29 11:12:38,535 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 159 transitions, 642 flow [2025-04-29 11:12:38,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-04-29 11:12:38,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:38,535 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] [2025-04-29 11:12:38,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:12:38,536 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:12:38,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash -271709362, now seen corresponding path program 1 times [2025-04-29 11:12:38,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:38,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249575843] [2025-04-29 11:12:38,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:38,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:38,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:12:38,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:12:38,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:38,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:38,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:38,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249575843] [2025-04-29 11:12:38,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249575843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:38,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:38,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354217233] [2025-04-29 11:12:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:38,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:12:38,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:38,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:12:38,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:12:38,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 118 [2025-04-29 11:12:38,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 159 transitions, 642 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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-04-29 11:12:38,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:38,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 118 [2025-04-29 11:12:38,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:39,064 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][119], [Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 115#L27-7true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 143#true, Black: 130#(= |#race~data~0| 0), 148#true, 117#L27-2true, Black: 123#true, 121#true, 119#true, 10#L45-1true]) [2025-04-29 11:12:39,064 INFO L286 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,064 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-29 11:12:39,064 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-29 11:12:39,064 INFO L289 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,078 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L37-5-->L37-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][125], [115#L27-7true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 143#true, 61#L37-6true, Black: 133#true, Black: 130#(= |#race~data~0| 0), 148#true, 117#L27-2true, Black: 125#(= |#race~threads_alive~0| 0), 121#true, 119#true]) [2025-04-29 11:12:39,078 INFO L286 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2025-04-29 11:12:39,078 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-29 11:12:39,078 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-29 11:12:39,078 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-29 11:12:39,087 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][119], [Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 115#L27-7true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 143#true, Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 130#(= |#race~data~0| 0), 148#true, 117#L27-2true, Black: 123#true, 121#true, 119#true, 10#L45-1true]) [2025-04-29 11:12:39,087 INFO L286 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,087 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-29 11:12:39,087 INFO L289 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,087 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-29 11:12:39,087 INFO L289 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,090 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][119], [Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 115#L27-7true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 143#true, 79#L27-1true, Black: 130#(= |#race~data~0| 0), 148#true, Black: 123#true, 121#true, 119#true, 10#L45-1true]) [2025-04-29 11:12:39,090 INFO L286 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-04-29 11:12:39,090 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:39,090 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:39,090 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-29 11:12:39,090 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][119], [Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 115#L27-7true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 143#true, Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 130#(= |#race~data~0| 0), 148#true, 117#L27-2true, Black: 123#true, 121#true, 119#true, 10#L45-1true]) [2025-04-29 11:12:39,090 INFO L286 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,090 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-29 11:12:39,091 INFO L289 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,091 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-29 11:12:39,091 INFO L289 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,091 INFO L289 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,115 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][70], [Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 17#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 145#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 143#true, Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 130#(= |#race~data~0| 0), 148#true, 117#L27-2true, Black: 123#true, 121#true, 119#true, 10#L45-1true]) [2025-04-29 11:12:39,115 INFO L286 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,115 INFO L289 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,115 INFO L289 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-04-29 11:12:39,115 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-29 11:12:39,132 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][70], [Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 42#L28true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 143#true, Black: 130#(= |#race~data~0| 0), 148#true, 117#L27-2true, Black: 123#true, 121#true, 119#true, 10#L45-1true]) [2025-04-29 11:12:39,132 INFO L286 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-04-29 11:12:39,132 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:39,132 INFO L289 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-04-29 11:12:39,133 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:39,133 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([269] L45-3-->L45-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][70], [Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 42#L28true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 143#true, Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 130#(= |#race~data~0| 0), 148#true, 117#L27-2true, Black: 123#true, 121#true, 10#L45-1true, 119#true]) [2025-04-29 11:12:39,133 INFO L286 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-04-29 11:12:39,134 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:39,134 INFO L289 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-04-29 11:12:39,134 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:39,134 INFO L289 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-04-29 11:12:39,258 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L27-5-->L27-6: Formula: (= |v_#race~threads_alive~0_13| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|} AuxVars[] AssignedVars[#race~threads_alive~0][80], [Black: 143#true, Black: 135#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), Black: 140#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 145#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 14#L27-6true, Black: 130#(= |#race~data~0| 0), 102#L39true, 148#true, 117#L27-2true, Black: 125#(= |#race~threads_alive~0| 0), 121#true, 119#true]) [2025-04-29 11:12:39,259 INFO L286 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2025-04-29 11:12:39,259 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2025-04-29 11:12:39,259 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2025-04-29 11:12:39,259 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2025-04-29 11:12:39,328 INFO L116 PetriNetUnfolderBase]: 2086/8258 cut-off events. [2025-04-29 11:12:39,328 INFO L117 PetriNetUnfolderBase]: For 4844/5370 co-relation queries the response was YES. [2025-04-29 11:12:39,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16920 conditions, 8258 events. 2086/8258 cut-off events. For 4844/5370 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 93969 event pairs, 561 based on Foata normal form. 54/7281 useless extension candidates. Maximal degree in co-relation 10153. Up to 1525 conditions per place. [2025-04-29 11:12:39,376 INFO L140 encePairwiseOnDemand]: 110/118 looper letters, 23 selfloop transitions, 9 changer transitions 1/176 dead transitions. [2025-04-29 11:12:39,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 176 transitions, 742 flow [2025-04-29 11:12:39,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions. [2025-04-29 11:12:39,378 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8968926553672316 [2025-04-29 11:12:39,378 INFO L175 Difference]: Start difference. First operand has 131 places, 159 transitions, 642 flow. Second operand 6 states and 635 transitions. [2025-04-29 11:12:39,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 176 transitions, 742 flow [2025-04-29 11:12:39,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 176 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:39,397 INFO L231 Difference]: Finished difference. Result has 136 places, 166 transitions, 655 flow [2025-04-29 11:12:39,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=655, PETRI_PLACES=136, PETRI_TRANSITIONS=166} [2025-04-29 11:12:39,398 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 16 predicate places. [2025-04-29 11:12:39,398 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 166 transitions, 655 flow [2025-04-29 11:12:39,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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-04-29 11:12:39,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:39,399 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:12:39,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:12:39,399 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:12:39,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash -323187224, now seen corresponding path program 1 times [2025-04-29 11:12:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:39,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584383761] [2025-04-29 11:12:39,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:39,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:12:39,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:12:39,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:39,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:39,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:12:39,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:12:39,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:12:39,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:39,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:39,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:12:39,429 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:12:39,430 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-04-29 11:12:39,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-04-29 11:12:39,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-04-29 11:12:39,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-04-29 11:12:39,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-04-29 11:12:39,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-04-29 11:12:39,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-04-29 11:12:39,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-04-29 11:12:39,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-04-29 11:12:39,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-04-29 11:12:39,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-04-29 11:12:39,431 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-04-29 11:12:39,431 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-04-29 11:12:39,431 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-04-29 11:12:39,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:12:39,431 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:39,468 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-29 11:12:39,468 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:12:39,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:12:39 BasicIcfg [2025-04-29 11:12:39,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:12:39,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:12:39,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:12:39,472 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:12:39,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:35" (3/4) ... [2025-04-29 11:12:39,473 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:12:39,527 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-04-29 11:12:39,556 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:12:39,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:12:39,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:12:39,559 INFO L158 Benchmark]: Toolchain (without parser) took 4889.93ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 107.4MB in the beginning and 313.7MB in the end (delta: -206.3MB). Peak memory consumption was 164.7MB. Max. memory is 16.1GB. [2025-04-29 11:12:39,559 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:39,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.89ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 93.4MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:39,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.73ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:39,560 INFO L158 Benchmark]: Boogie Preprocessor took 20.07ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.9MB in the end (delta: 859.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:39,560 INFO L158 Benchmark]: RCFGBuilder took 238.89ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 77.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:39,561 INFO L158 Benchmark]: TraceAbstraction took 4299.70ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 77.1MB in the beginning and 325.8MB in the end (delta: -248.7MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. [2025-04-29 11:12:39,561 INFO L158 Benchmark]: Witness Printer took 84.94ms. Allocated memory is still 520.1MB. Free memory was 325.8MB in the beginning and 313.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:39,562 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.89ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 93.4MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.73ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.07ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.9MB in the end (delta: 859.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 238.89ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 77.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4299.70ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 77.1MB in the beginning and 325.8MB in the end (delta: -248.7MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. * Witness Printer took 84.94ms. Allocated memory is still 520.1MB. Free memory was 325.8MB in the beginning and 313.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 27]: Data race detected Data race detected The following path leads to a data race: [L17] 0 int threads_alive = 0; VAL [threads_alive=0] [L19] 0 int data = 0; VAL [data=0, threads_alive=0] [L20] 0 pthread_mutex_t data_mutex = PTHREAD_MUTEX_INITIALIZER; VAL [data=0, data_mutex={1:0}, threads_alive=0] [L32] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_alive=0, threads_total=2] [L33] CALL 0 assume_abort_if_not(threads_total >= 0) [L13] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1, data=0, data_mutex={1:0}, threads_alive=0] [L33] RET 0 assume_abort_if_not(threads_total >= 0) [L36] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L36] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L37] 0 threads_alive++ VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L39] 0 pthread_t tid; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L40] FCALL, FORK 0 pthread_create(&tid, NULL, &thread, NULL) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2, tid=-1] [L36] 0 i++ VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L36] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L37] 0 threads_alive++ VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L37] 0 threads_alive++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L24] 1 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1] [L27] 1 threads_alive-- VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1] [L37] 0 threads_alive++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2] [L27] 1 threads_alive-- VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2] Now there is a data race on ~threads_alive~0 between C: threads_alive++ [37] and C: threads_alive-- [27] - UnprovableResult [Line: 37]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 116 locations, 118 edges, 11 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: 1.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 184 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 36 mSDtfsCounter, 184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=5, InterpolantAutomatonStates: 21, 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, 0.3s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 144 locations, 146 edges, 14 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: 2.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 314 IncrementalHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 41 mSDtfsCounter, 314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=655occurred in iteration=6, InterpolantAutomatonStates: 21, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-29 11:12:39,576 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)