./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-inner-race-5.i --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-inner-race-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c9074e122b1777f395c954ed30ab626f529c102cb2614b7e83435b6d498a843 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:31:14,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:31:14,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:31:14,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:31:14,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:31:14,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:31:14,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:31:14,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:31:14,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:31:14,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:31:14,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:31:14,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:31:14,697 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:31:14,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:31:14,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:31:14,698 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:31:14,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:31:14,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:31:14,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:31:14,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:31:14,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:31:14,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:31:14,698 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:31:14,698 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:31:14,698 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:31:14,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:31:14,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:31:14,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:31:14,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:31:14,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:31:14,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:31:14,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:14,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:31:14,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:31:14,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:31:14,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:14,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:31:14,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:31:14,700 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:31:14,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:31:14,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:31:14,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:31:14,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:31:14,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:31:14,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:31:14,701 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 -> 9c9074e122b1777f395c954ed30ab626f529c102cb2614b7e83435b6d498a843 [2025-04-30 10:31:14,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:31:14,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:31:14,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:31:14,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:31:14,929 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:31:14,930 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-inner-race-5.i [2025-04-30 10:31:16,241 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0452e97/3c377b3e5abe4a8292840320931ced4f/FLAG2600a40e0 [2025-04-30 10:31:16,512 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:31:16,513 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-inner-race-5.i [2025-04-30 10:31:16,524 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0452e97/3c377b3e5abe4a8292840320931ced4f/FLAG2600a40e0 [2025-04-30 10:31:17,243 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0452e97/3c377b3e5abe4a8292840320931ced4f [2025-04-30 10:31:17,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:31:17,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:31:17,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:31:17,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:31:17,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:31:17,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65016302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17, skipping insertion in model container [2025-04-30 10:31:17,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:31:17,551 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:31:17,567 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:31:17,614 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:31:17,642 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:31:17,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17 WrapperNode [2025-04-30 10:31:17,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:31:17,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:31:17,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:31:17,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:31:17,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,675 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 179 [2025-04-30 10:31:17,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:31:17,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:31:17,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:31:17,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:31:17,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,697 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:31:17,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:31:17,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:31:17,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:31:17,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (1/1) ... [2025-04-30 10:31:17,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:17,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:31:17,738 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-30 10:31:17,740 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-30 10:31:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:31:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:31:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:31:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:31:17,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:31:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:31:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:31:17,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:31:17,756 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:31:17,853 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:31:17,854 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:31:18,066 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:31:18,067 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:31:18,097 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:31:18,097 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:31:18,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:18 BoogieIcfgContainer [2025-04-30 10:31:18,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:31:18,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:31:18,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:31:18,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:31:18,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:31:17" (1/3) ... [2025-04-30 10:31:18,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7736923b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:31:18, skipping insertion in model container [2025-04-30 10:31:18,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:17" (2/3) ... [2025-04-30 10:31:18,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7736923b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:31:18, skipping insertion in model container [2025-04-30 10:31:18,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:18" (3/3) ... [2025-04-30 10:31:18,104 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-inner-race-5.i [2025-04-30 10:31:18,116 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:31:18,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-inner-race-5.i that has 2 procedures, 230 locations, 232 edges, 1 initial locations, 2 loop locations, and 7 error locations. [2025-04-30 10:31:18,118 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:31:18,178 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:31:18,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 233 transitions, 470 flow [2025-04-30 10:31:18,331 INFO L116 PetriNetUnfolderBase]: 5/259 cut-off events. [2025-04-30 10:31:18,334 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:18,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 259 events. 5/259 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 177. Up to 4 conditions per place. [2025-04-30 10:31:18,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 233 transitions, 470 flow [2025-04-30 10:31:18,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 233 transitions, 470 flow [2025-04-30 10:31:18,351 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:18,359 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;@1aa09697, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:18,359 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-30 10:31:18,382 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:18,382 INFO L116 PetriNetUnfolderBase]: 1/163 cut-off events. [2025-04-30 10:31:18,382 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:18,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:18,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:18,383 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-04-30 10:31:18,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:18,389 INFO L85 PathProgramCache]: Analyzing trace with hash 596135461, now seen corresponding path program 1 times [2025-04-30 10:31:18,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:18,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167837866] [2025-04-30 10:31:18,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:18,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:18,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-04-30 10:31:18,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-04-30 10:31:18,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:18,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:18,709 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-30 10:31:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:18,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167837866] [2025-04-30 10:31:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167837866] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:18,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332938878] [2025-04-30 10:31:18,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:18,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:18,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:18,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:18,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:18,768 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-04-30 10:31:18,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 233 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-30 10:31:18,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:18,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-04-30 10:31:18,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:18,942 INFO L116 PetriNetUnfolderBase]: 122/754 cut-off events. [2025-04-30 10:31:18,942 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:31:18,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 754 events. 122/754 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3249 event pairs, 29 based on Foata normal form. 1/690 useless extension candidates. Maximal degree in co-relation 832. Up to 167 conditions per place. [2025-04-30 10:31:18,947 INFO L140 encePairwiseOnDemand]: 222/233 looper letters, 28 selfloop transitions, 6 changer transitions 1/243 dead transitions. [2025-04-30 10:31:18,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 243 transitions, 558 flow [2025-04-30 10:31:18,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-04-30 10:31:18,957 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9542203147353362 [2025-04-30 10:31:18,958 INFO L175 Difference]: Start difference. First operand has 233 places, 233 transitions, 470 flow. Second operand 3 states and 667 transitions. [2025-04-30 10:31:18,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 243 transitions, 558 flow [2025-04-30 10:31:18,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 243 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:18,966 INFO L231 Difference]: Finished difference. Result has 235 places, 232 transitions, 502 flow [2025-04-30 10:31:18,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=235, PETRI_TRANSITIONS=232} [2025-04-30 10:31:18,970 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 2 predicate places. [2025-04-30 10:31:18,970 INFO L485 AbstractCegarLoop]: Abstraction has has 235 places, 232 transitions, 502 flow [2025-04-30 10:31:18,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-30 10:31:18,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:18,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:18,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:31:18,971 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-04-30 10:31:18,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1038939146, now seen corresponding path program 1 times [2025-04-30 10:31:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:18,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860835187] [2025-04-30 10:31:18,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:19,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-30 10:31:19,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-30 10:31:19,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:19,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:19,136 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-30 10:31:19,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:19,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860835187] [2025-04-30 10:31:19,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860835187] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:19,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:19,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:19,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802112684] [2025-04-30 10:31:19,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:19,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:19,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:19,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:19,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:19,146 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 233 [2025-04-30 10:31:19,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 232 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-30 10:31:19,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:19,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 233 [2025-04-30 10:31:19,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:19,251 INFO L116 PetriNetUnfolderBase]: 122/847 cut-off events. [2025-04-30 10:31:19,252 INFO L117 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-04-30 10:31:19,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 847 events. 122/847 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4144 event pairs, 56 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 1010. Up to 170 conditions per place. [2025-04-30 10:31:19,256 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 19 selfloop transitions, 3 changer transitions 1/240 dead transitions. [2025-04-30 10:31:19,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 240 transitions, 564 flow [2025-04-30 10:31:19,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 672 transitions. [2025-04-30 10:31:19,259 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9613733905579399 [2025-04-30 10:31:19,259 INFO L175 Difference]: Start difference. First operand has 235 places, 232 transitions, 502 flow. Second operand 3 states and 672 transitions. [2025-04-30 10:31:19,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 240 transitions, 564 flow [2025-04-30 10:31:19,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 240 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:19,266 INFO L231 Difference]: Finished difference. Result has 236 places, 234 transitions, 512 flow [2025-04-30 10:31:19,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=236, PETRI_TRANSITIONS=234} [2025-04-30 10:31:19,268 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 3 predicate places. [2025-04-30 10:31:19,271 INFO L485 AbstractCegarLoop]: Abstraction has has 236 places, 234 transitions, 512 flow [2025-04-30 10:31:19,272 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-30 10:31:19,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:19,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:19,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:31:19,272 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-04-30 10:31:19,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash -385699640, now seen corresponding path program 1 times [2025-04-30 10:31:19,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:19,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078184337] [2025-04-30 10:31:19,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:19,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:19,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:31:19,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:31:19,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:19,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:19,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-30 10:31:19,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:19,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078184337] [2025-04-30 10:31:19,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078184337] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:19,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:19,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:19,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082199022] [2025-04-30 10:31:19,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:19,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:19,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:19,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:19,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:19,391 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-04-30 10:31:19,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 234 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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-30 10:31:19,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:19,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-04-30 10:31:19,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:19,521 INFO L116 PetriNetUnfolderBase]: 146/883 cut-off events. [2025-04-30 10:31:19,521 INFO L117 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-04-30 10:31:19,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 883 events. 146/883 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4222 event pairs, 73 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1150. Up to 267 conditions per place. [2025-04-30 10:31:19,524 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 26 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2025-04-30 10:31:19,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 242 transitions, 594 flow [2025-04-30 10:31:19,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2025-04-30 10:31:19,528 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9456366237482118 [2025-04-30 10:31:19,528 INFO L175 Difference]: Start difference. First operand has 236 places, 234 transitions, 512 flow. Second operand 3 states and 661 transitions. [2025-04-30 10:31:19,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 242 transitions, 594 flow [2025-04-30 10:31:19,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 242 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:19,534 INFO L231 Difference]: Finished difference. Result has 238 places, 238 transitions, 548 flow [2025-04-30 10:31:19,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=238, PETRI_TRANSITIONS=238} [2025-04-30 10:31:19,535 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2025-04-30 10:31:19,535 INFO L485 AbstractCegarLoop]: Abstraction has has 238 places, 238 transitions, 548 flow [2025-04-30 10:31:19,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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-30 10:31:19,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:19,536 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:31:19,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:31:19,536 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-04-30 10:31:19,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1371749897, now seen corresponding path program 1 times [2025-04-30 10:31:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:19,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818096963] [2025-04-30 10:31:19,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:19,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:19,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-04-30 10:31:19,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-04-30 10:31:19,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:19,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:19,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:19,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-04-30 10:31:19,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-04-30 10:31:19,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:19,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:19,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:19,644 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:19,644 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-04-30 10:31:19,645 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-04-30 10:31:19,646 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-04-30 10:31:19,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-04-30 10:31:19,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-04-30 10:31:19,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-04-30 10:31:19,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-04-30 10:31:19,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-04-30 10:31:19,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-04-30 10:31:19,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-04-30 10:31:19,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-04-30 10:31:19,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-04-30 10:31:19,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-04-30 10:31:19,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:31:19,647 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-30 10:31:19,649 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:31:19,649 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:31:19,671 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:31:19,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 280 transitions, 570 flow [2025-04-30 10:31:19,715 INFO L116 PetriNetUnfolderBase]: 7/340 cut-off events. [2025-04-30 10:31:19,715 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:31:19,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 340 events. 7/340 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 464 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 260. Up to 6 conditions per place. [2025-04-30 10:31:19,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 282 places, 280 transitions, 570 flow [2025-04-30 10:31:19,719 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 280 transitions, 570 flow [2025-04-30 10:31:19,721 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:19,721 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;@1aa09697, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:19,721 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-04-30 10:31:19,729 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:19,729 INFO L116 PetriNetUnfolderBase]: 1/163 cut-off events. [2025-04-30 10:31:19,729 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:19,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:19,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:19,729 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-04-30 10:31:19,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1984354243, now seen corresponding path program 1 times [2025-04-30 10:31:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:19,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324671920] [2025-04-30 10:31:19,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:19,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-04-30 10:31:19,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-04-30 10:31:19,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:19,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:19,794 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-30 10:31:19,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:19,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324671920] [2025-04-30 10:31:19,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324671920] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:19,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:19,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457536284] [2025-04-30 10:31:19,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:19,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:19,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:19,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:19,827 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 280 [2025-04-30 10:31:19,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 280 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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-30 10:31:19,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:19,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 280 [2025-04-30 10:31:19,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:21,217 INFO L116 PetriNetUnfolderBase]: 4627/13176 cut-off events. [2025-04-30 10:31:21,218 INFO L117 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-04-30 10:31:21,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20586 conditions, 13176 events. 4627/13176 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 131186 event pairs, 1551 based on Foata normal form. 1/11688 useless extension candidates. Maximal degree in co-relation 19499. Up to 4243 conditions per place. [2025-04-30 10:31:21,275 INFO L140 encePairwiseOnDemand]: 259/280 looper letters, 54 selfloop transitions, 14 changer transitions 1/309 dead transitions. [2025-04-30 10:31:21,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 309 transitions, 769 flow [2025-04-30 10:31:21,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2025-04-30 10:31:21,279 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9511904761904761 [2025-04-30 10:31:21,280 INFO L175 Difference]: Start difference. First operand has 282 places, 280 transitions, 570 flow. Second operand 3 states and 799 transitions. [2025-04-30 10:31:21,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 309 transitions, 769 flow [2025-04-30 10:31:21,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 309 transitions, 769 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:21,285 INFO L231 Difference]: Finished difference. Result has 286 places, 291 transitions, 686 flow [2025-04-30 10:31:21,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=286, PETRI_TRANSITIONS=291} [2025-04-30 10:31:21,286 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 4 predicate places. [2025-04-30 10:31:21,286 INFO L485 AbstractCegarLoop]: Abstraction has has 286 places, 291 transitions, 686 flow [2025-04-30 10:31:21,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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-30 10:31:21,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:21,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:21,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:31:21,287 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-04-30 10:31:21,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:21,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1863705610, now seen corresponding path program 1 times [2025-04-30 10:31:21,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:21,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879692291] [2025-04-30 10:31:21,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:21,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:21,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-30 10:31:21,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-30 10:31:21,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:21,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:21,359 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-30 10:31:21,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:21,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879692291] [2025-04-30 10:31:21,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879692291] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:21,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:21,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432715681] [2025-04-30 10:31:21,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:21,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:21,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:21,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:21,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:21,407 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 280 [2025-04-30 10:31:21,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 291 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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-30 10:31:21,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:21,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 280 [2025-04-30 10:31:21,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:22,932 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, 99#L699-1true, Black: 285#true, 224#L713-1true, 283#true, 290#true, 216#L699-6true, 287#(= |#race~threads_alive~0| 0)]) [2025-04-30 10:31:22,932 INFO L286 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-04-30 10:31:22,932 INFO L289 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-04-30 10:31:22,932 INFO L289 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-04-30 10:31:22,932 INFO L289 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-04-30 10:31:22,943 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, 24#L699-2true, Black: 285#true, 224#L713-1true, 283#true, 290#true, 216#L699-6true, 287#(= |#race~threads_alive~0| 0)]) [2025-04-30 10:31:22,943 INFO L286 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-04-30 10:31:22,943 INFO L289 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-04-30 10:31:22,943 INFO L289 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-04-30 10:31:22,943 INFO L289 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-04-30 10:31:22,980 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [281#true, Black: 285#true, 224#L713-1true, 283#true, 169#L699-6true, 290#true, 216#L699-6true, 287#(= |#race~threads_alive~0| 0)]) [2025-04-30 10:31:22,980 INFO L286 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-04-30 10:31:22,981 INFO L289 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-04-30 10:31:22,981 INFO L289 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-04-30 10:31:22,981 INFO L289 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-04-30 10:31:23,012 INFO L116 PetriNetUnfolderBase]: 4195/15297 cut-off events. [2025-04-30 10:31:23,012 INFO L117 PetriNetUnfolderBase]: For 824/865 co-relation queries the response was YES. [2025-04-30 10:31:23,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24305 conditions, 15297 events. 4195/15297 cut-off events. For 824/865 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 173324 event pairs, 2308 based on Foata normal form. 0/13662 useless extension candidates. Maximal degree in co-relation 23033. Up to 4051 conditions per place. [2025-04-30 10:31:23,089 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 34 selfloop transitions, 4 changer transitions 0/306 dead transitions. [2025-04-30 10:31:23,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 306 transitions, 792 flow [2025-04-30 10:31:23,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2025-04-30 10:31:23,092 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9571428571428572 [2025-04-30 10:31:23,092 INFO L175 Difference]: Start difference. First operand has 286 places, 291 transitions, 686 flow. Second operand 3 states and 804 transitions. [2025-04-30 10:31:23,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 306 transitions, 792 flow [2025-04-30 10:31:23,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 306 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:23,106 INFO L231 Difference]: Finished difference. Result has 287 places, 294 transitions, 688 flow [2025-04-30 10:31:23,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=287, PETRI_TRANSITIONS=294} [2025-04-30 10:31:23,109 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 5 predicate places. [2025-04-30 10:31:23,110 INFO L485 AbstractCegarLoop]: Abstraction has has 287 places, 294 transitions, 688 flow [2025-04-30 10:31:23,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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-30 10:31:23,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:23,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:23,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:31:23,111 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-04-30 10:31:23,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:23,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1930093938, now seen corresponding path program 1 times [2025-04-30 10:31:23,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:23,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818831856] [2025-04-30 10:31:23,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:23,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:23,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:31:23,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:31:23,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:23,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:23,185 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-30 10:31:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:23,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818831856] [2025-04-30 10:31:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818831856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:23,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739456322] [2025-04-30 10:31:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:23,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:23,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:23,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:23,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:23,219 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 280 [2025-04-30 10:31:23,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 294 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-30 10:31:23,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:23,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 280 [2025-04-30 10:31:23,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:23,543 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][237], [281#true, 69#L692-7true, Black: 285#true, 224#L713-1true, 283#true, 259#L692-2true, 290#true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:23,547 INFO L286 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-04-30 10:31:23,548 INFO L289 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-04-30 10:31:23,548 INFO L289 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-04-30 10:31:23,548 INFO L289 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-04-30 10:31:23,622 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, 225#L694true, Black: 285#true, 224#L713-1true, 283#true, 259#L692-2true, 290#true, 295#true, Black: 292#(= |#race~data~0| 0)]) [2025-04-30 10:31:23,623 INFO L286 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-04-30 10:31:23,623 INFO L289 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-04-30 10:31:23,623 INFO L289 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-04-30 10:31:23,623 INFO L289 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-04-30 10:31:23,650 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, 224#L713-1true, 283#true, 122#L694-3true, 259#L692-2true, 290#true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:23,650 INFO L286 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-04-30 10:31:23,650 INFO L289 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-04-30 10:31:23,650 INFO L289 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-04-30 10:31:23,650 INFO L289 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-04-30 10:31:23,724 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, 224#L713-1true, 283#true, 259#L692-2true, 290#true, 238#L695-3true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:23,725 INFO L286 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2025-04-30 10:31:23,725 INFO L289 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-04-30 10:31:23,725 INFO L289 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-04-30 10:31:23,725 INFO L289 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-04-30 10:31:24,067 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, 224#L713-1true, 283#true, 259#L692-2true, 290#true, 279#L697-3true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:24,067 INFO L286 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-04-30 10:31:24,067 INFO L289 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-04-30 10:31:24,067 INFO L289 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-04-30 10:31:24,068 INFO L289 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-04-30 10:31:24,114 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, 65#L698-3true, Black: 285#true, 224#L713-1true, 283#true, 259#L692-2true, 290#true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:24,114 INFO L286 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-04-30 10:31:24,114 INFO L289 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-04-30 10:31:24,114 INFO L289 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-04-30 10:31:24,114 INFO L289 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-04-30 10:31:24,379 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][237], [281#true, 69#L692-7true, Black: 285#true, 224#L713-1true, 283#true, 290#true, 252#L699-2true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:24,380 INFO L286 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-04-30 10:31:24,380 INFO L289 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-04-30 10:31:24,380 INFO L289 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-04-30 10:31:24,380 INFO L289 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-04-30 10:31:24,465 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, 225#L694true, Black: 285#true, 224#L713-1true, 283#true, 290#true, 252#L699-2true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:24,466 INFO L286 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-04-30 10:31:24,466 INFO L289 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-04-30 10:31:24,466 INFO L289 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-04-30 10:31:24,466 INFO L289 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-04-30 10:31:24,491 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, 224#L713-1true, 122#L694-3true, 283#true, 290#true, 252#L699-2true, 295#true, Black: 292#(= |#race~data~0| 0)]) [2025-04-30 10:31:24,491 INFO L286 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-04-30 10:31:24,492 INFO L289 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-04-30 10:31:24,492 INFO L289 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-04-30 10:31:24,492 INFO L289 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-04-30 10:31:24,539 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, 224#L713-1true, 283#true, 290#true, 238#L695-3true, 252#L699-2true, 295#true, Black: 292#(= |#race~data~0| 0)]) [2025-04-30 10:31:24,539 INFO L286 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-04-30 10:31:24,539 INFO L289 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-04-30 10:31:24,539 INFO L289 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-04-30 10:31:24,539 INFO L289 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-04-30 10:31:24,815 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, 224#L713-1true, 283#true, 290#true, 252#L699-2true, 279#L697-3true, 295#true, Black: 292#(= |#race~data~0| 0)]) [2025-04-30 10:31:24,816 INFO L286 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-04-30 10:31:24,816 INFO L289 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-04-30 10:31:24,816 INFO L289 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-04-30 10:31:24,816 INFO L289 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-04-30 10:31:24,853 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, 65#L698-3true, Black: 285#true, 224#L713-1true, 283#true, 290#true, 252#L699-2true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:24,853 INFO L286 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2025-04-30 10:31:24,853 INFO L289 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-04-30 10:31:24,853 INFO L289 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-04-30 10:31:24,853 INFO L289 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-04-30 10:31:25,056 INFO L116 PetriNetUnfolderBase]: 5624/18320 cut-off events. [2025-04-30 10:31:25,056 INFO L117 PetriNetUnfolderBase]: For 2760/3027 co-relation queries the response was YES. [2025-04-30 10:31:25,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32070 conditions, 18320 events. 5624/18320 cut-off events. For 2760/3027 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 203842 event pairs, 2938 based on Foata normal form. 94/16589 useless extension candidates. Maximal degree in co-relation 25962. Up to 7539 conditions per place. [2025-04-30 10:31:25,163 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 49 selfloop transitions, 14 changer transitions 0/317 dead transitions. [2025-04-30 10:31:25,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 317 transitions, 885 flow [2025-04-30 10:31:25,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2025-04-30 10:31:25,166 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2025-04-30 10:31:25,166 INFO L175 Difference]: Start difference. First operand has 287 places, 294 transitions, 688 flow. Second operand 3 states and 791 transitions. [2025-04-30 10:31:25,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 317 transitions, 885 flow [2025-04-30 10:31:25,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 317 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:25,183 INFO L231 Difference]: Finished difference. Result has 289 places, 306 transitions, 806 flow [2025-04-30 10:31:25,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=289, PETRI_TRANSITIONS=306} [2025-04-30 10:31:25,184 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 7 predicate places. [2025-04-30 10:31:25,184 INFO L485 AbstractCegarLoop]: Abstraction has has 289 places, 306 transitions, 806 flow [2025-04-30 10:31:25,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-30 10:31:25,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:25,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:25,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:31:25,185 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-04-30 10:31:25,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash 913822549, now seen corresponding path program 1 times [2025-04-30 10:31:25,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:25,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765263279] [2025-04-30 10:31:25,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:25,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:25,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-04-30 10:31:25,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-04-30 10:31:25,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:25,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:25,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:25,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765263279] [2025-04-30 10:31:25,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765263279] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:25,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:25,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:25,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969079671] [2025-04-30 10:31:25,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:25,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:25,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:25,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:25,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:25,276 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 280 [2025-04-30 10:31:25,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 306 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-30 10:31:25,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:25,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 280 [2025-04-30 10:31:25,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:25,528 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][233], [69#L692-7true, 281#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 285#true, 224#L713-1true, 283#true, 300#true, 259#L692-2true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:25,528 INFO L286 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-04-30 10:31:25,528 INFO L289 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-04-30 10:31:25,528 INFO L289 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-04-30 10:31:25,528 INFO L289 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-04-30 10:31:25,597 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, 225#L694true, Black: 285#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 224#L713-1true, 283#true, 259#L692-2true, 300#true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:25,598 INFO L286 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-04-30 10:31:25,598 INFO L289 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-04-30 10:31:25,598 INFO L289 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-04-30 10:31:25,598 INFO L289 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-04-30 10:31:26,352 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L699-->L699-1: Formula: (= |v_#race~threads_alive~0_14| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_14|} AuxVars[] AssignedVars[#race~threads_alive~0][318], [69#L692-7true, 281#true, 15#L713-2true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 285#true, 78#L699-1true, 283#true, 300#true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:26,353 INFO L286 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-04-30 10:31:26,353 INFO L289 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-04-30 10:31:26,353 INFO L289 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-04-30 10:31:26,353 INFO L289 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-04-30 10:31:26,387 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][233], [69#L692-7true, 281#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 285#true, 224#L713-1true, 78#L699-1true, 283#true, 300#true, 295#true, Black: 292#(= |#race~data~0| 0)]) [2025-04-30 10:31:26,388 INFO L286 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L289 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L289 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L289 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][233], [69#L692-7true, 281#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 285#true, 224#L713-1true, 283#true, 300#true, 252#L699-2true, Black: 292#(= |#race~data~0| 0), 295#true]) [2025-04-30 10:31:26,388 INFO L286 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L289 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L289 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L289 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][233], [69#L692-7true, 281#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 285#true, 224#L713-1true, 283#true, 300#true, 252#L699-2true, 295#true, Black: 292#(= |#race~data~0| 0)]) [2025-04-30 10:31:26,388 INFO L286 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L289 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L289 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L289 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-04-30 10:31:26,388 INFO L289 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-04-30 10:31:26,448 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 224#L713-1true, 283#true, 13#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 300#true, 252#L699-2true, 295#true, Black: 292#(= |#race~data~0| 0)]) [2025-04-30 10:31:26,448 INFO L286 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-04-30 10:31:26,448 INFO L289 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-04-30 10:31:26,448 INFO L289 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-04-30 10:31:26,448 INFO L289 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-04-30 10:31:26,455 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, 225#L694true, Black: 285#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 224#L713-1true, 283#true, 300#true, 252#L699-2true, 295#true, Black: 292#(= |#race~data~0| 0)]) [2025-04-30 10:31:26,455 INFO L286 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-04-30 10:31:26,455 INFO L289 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-04-30 10:31:26,455 INFO L289 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-04-30 10:31:26,455 INFO L289 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-04-30 10:31:27,196 INFO L116 PetriNetUnfolderBase]: 5599/20226 cut-off events. [2025-04-30 10:31:27,196 INFO L117 PetriNetUnfolderBase]: For 3168/3526 co-relation queries the response was YES. [2025-04-30 10:31:27,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34706 conditions, 20226 events. 5599/20226 cut-off events. For 3168/3526 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 239376 event pairs, 3099 based on Foata normal form. 21/18165 useless extension candidates. Maximal degree in co-relation 33125. Up to 6066 conditions per place. [2025-04-30 10:31:27,298 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 36 selfloop transitions, 7 changer transitions 0/322 dead transitions. [2025-04-30 10:31:27,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 322 transitions, 935 flow [2025-04-30 10:31:27,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2025-04-30 10:31:27,300 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-04-30 10:31:27,300 INFO L175 Difference]: Start difference. First operand has 289 places, 306 transitions, 806 flow. Second operand 3 states and 800 transitions. [2025-04-30 10:31:27,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 322 transitions, 935 flow [2025-04-30 10:31:27,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 322 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:27,311 INFO L231 Difference]: Finished difference. Result has 291 places, 311 transitions, 834 flow [2025-04-30 10:31:27,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=291, PETRI_TRANSITIONS=311} [2025-04-30 10:31:27,312 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 9 predicate places. [2025-04-30 10:31:27,312 INFO L485 AbstractCegarLoop]: Abstraction has has 291 places, 311 transitions, 834 flow [2025-04-30 10:31:27,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-30 10:31:27,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:27,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:27,313 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:31:27,313 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-04-30 10:31:27,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:27,313 INFO L85 PathProgramCache]: Analyzing trace with hash -79537274, now seen corresponding path program 1 times [2025-04-30 10:31:27,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:27,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374777884] [2025-04-30 10:31:27,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:27,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:27,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-04-30 10:31:27,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-04-30 10:31:27,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:27,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:27,488 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-30 10:31:27,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:27,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374777884] [2025-04-30 10:31:27,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374777884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:27,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:27,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:31:27,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437752527] [2025-04-30 10:31:27,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:27,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:27,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:27,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:27,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:27,499 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 280 [2025-04-30 10:31:27,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 311 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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-30 10:31:27,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:27,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 280 [2025-04-30 10:31:27,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:28,431 INFO L116 PetriNetUnfolderBase]: 1939/10763 cut-off events. [2025-04-30 10:31:28,431 INFO L117 PetriNetUnfolderBase]: For 1725/2026 co-relation queries the response was YES. [2025-04-30 10:31:28,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17785 conditions, 10763 events. 1939/10763 cut-off events. For 1725/2026 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 127658 event pairs, 551 based on Foata normal form. 260/10107 useless extension candidates. Maximal degree in co-relation 16781. Up to 1517 conditions per place. [2025-04-30 10:31:28,479 INFO L140 encePairwiseOnDemand]: 266/280 looper letters, 16 selfloop transitions, 14 changer transitions 0/318 dead transitions. [2025-04-30 10:31:28,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 318 transitions, 897 flow [2025-04-30 10:31:28,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2025-04-30 10:31:28,481 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9678571428571429 [2025-04-30 10:31:28,481 INFO L175 Difference]: Start difference. First operand has 291 places, 311 transitions, 834 flow. Second operand 3 states and 813 transitions. [2025-04-30 10:31:28,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 318 transitions, 897 flow [2025-04-30 10:31:28,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 318 transitions, 883 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:28,488 INFO L231 Difference]: Finished difference. Result has 292 places, 315 transitions, 870 flow [2025-04-30 10:31:28,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=292, PETRI_TRANSITIONS=315} [2025-04-30 10:31:28,489 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 10 predicate places. [2025-04-30 10:31:28,489 INFO L485 AbstractCegarLoop]: Abstraction has has 292 places, 315 transitions, 870 flow [2025-04-30 10:31:28,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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-30 10:31:28,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:28,490 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:31:28,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:31:28,491 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-04-30 10:31:28,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:28,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1192471986, now seen corresponding path program 1 times [2025-04-30 10:31:28,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:28,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049546447] [2025-04-30 10:31:28,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:28,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-04-30 10:31:28,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-04-30 10:31:28,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:28,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:28,540 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-30 10:31:28,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:28,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049546447] [2025-04-30 10:31:28,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049546447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:28,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:28,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:28,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139750527] [2025-04-30 10:31:28,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:28,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:28,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:28,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:28,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:28,573 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 280 [2025-04-30 10:31:28,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 315 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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-30 10:31:28,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:28,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 280 [2025-04-30 10:31:28,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:30,026 INFO L116 PetriNetUnfolderBase]: 3011/13203 cut-off events. [2025-04-30 10:31:30,027 INFO L117 PetriNetUnfolderBase]: For 6928/7565 co-relation queries the response was YES. [2025-04-30 10:31:30,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27760 conditions, 13203 events. 3011/13203 cut-off events. For 6928/7565 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 154737 event pairs, 1192 based on Foata normal form. 50/12222 useless extension candidates. Maximal degree in co-relation 26513. Up to 4906 conditions per place. [2025-04-30 10:31:30,095 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 60 selfloop transitions, 10 changer transitions 0/331 dead transitions. [2025-04-30 10:31:30,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 331 transitions, 1079 flow [2025-04-30 10:31:30,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2025-04-30 10:31:30,097 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9357142857142857 [2025-04-30 10:31:30,097 INFO L175 Difference]: Start difference. First operand has 292 places, 315 transitions, 870 flow. Second operand 3 states and 786 transitions. [2025-04-30 10:31:30,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 331 transitions, 1079 flow [2025-04-30 10:31:30,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 331 transitions, 1058 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:31:30,106 INFO L231 Difference]: Finished difference. Result has 295 places, 323 transitions, 946 flow [2025-04-30 10:31:30,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=295, PETRI_TRANSITIONS=323} [2025-04-30 10:31:30,106 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 13 predicate places. [2025-04-30 10:31:30,106 INFO L485 AbstractCegarLoop]: Abstraction has has 295 places, 323 transitions, 946 flow [2025-04-30 10:31:30,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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-30 10:31:30,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:30,107 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:31:30,107 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:31:30,107 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-04-30 10:31:30,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:30,108 INFO L85 PathProgramCache]: Analyzing trace with hash -703503537, now seen corresponding path program 1 times [2025-04-30 10:31:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:30,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083860563] [2025-04-30 10:31:30,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:30,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:30,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-04-30 10:31:30,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-04-30 10:31:30,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:30,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:30,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:30,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-04-30 10:31:30,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-04-30 10:31:30,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:30,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:30,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:30,185 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:30,185 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-04-30 10:31:30,186 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-04-30 10:31:30,187 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-04-30 10:31:30,187 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-04-30 10:31:30,187 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-04-30 10:31:30,187 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-04-30 10:31:30,187 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-04-30 10:31:30,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:31:30,187 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:30,188 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:31:30,188 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-30 10:31:30,227 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:31:30,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 327 transitions, 672 flow [2025-04-30 10:31:30,270 INFO L116 PetriNetUnfolderBase]: 9/421 cut-off events. [2025-04-30 10:31:30,270 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-30 10:31:30,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 421 events. 9/421 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 800 event pairs, 0 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 344. Up to 8 conditions per place. [2025-04-30 10:31:30,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 327 transitions, 672 flow [2025-04-30 10:31:30,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 331 places, 327 transitions, 672 flow [2025-04-30 10:31:30,276 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:30,276 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;@1aa09697, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:30,276 INFO L341 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-04-30 10:31:30,286 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:30,286 INFO L116 PetriNetUnfolderBase]: 1/163 cut-off events. [2025-04-30 10:31:30,287 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:30,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:30,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:30,287 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2025-04-30 10:31:30,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:30,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1577362908, now seen corresponding path program 1 times [2025-04-30 10:31:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:30,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051367806] [2025-04-30 10:31:30,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:30,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:30,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-04-30 10:31:30,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-04-30 10:31:30,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:30,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:30,342 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-30 10:31:30,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:30,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051367806] [2025-04-30 10:31:30,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051367806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:30,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:30,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:30,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910966513] [2025-04-30 10:31:30,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:30,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:30,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:30,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:30,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:30,388 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 327 [2025-04-30 10:31:30,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 327 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-30 10:31:30,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:30,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 327 [2025-04-30 10:31:30,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:55,203 INFO L116 PetriNetUnfolderBase]: 119918/257925 cut-off events. [2025-04-30 10:31:55,203 INFO L117 PetriNetUnfolderBase]: For 1618/1618 co-relation queries the response was YES. [2025-04-30 10:31:55,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426303 conditions, 257925 events. 119918/257925 cut-off events. For 1618/1618 co-relation queries the response was YES. Maximal size of possible extension queue 5110. Compared 3349677 event pairs, 42479 based on Foata normal form. 1/227128 useless extension candidates. Maximal degree in co-relation 332503. Up to 93558 conditions per place. [2025-04-30 10:31:56,736 INFO L140 encePairwiseOnDemand]: 298/327 looper letters, 76 selfloop transitions, 20 changer transitions 1/369 dead transitions. [2025-04-30 10:31:56,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 369 transitions, 960 flow [2025-04-30 10:31:56,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-04-30 10:31:56,738 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9429153924566769 [2025-04-30 10:31:56,738 INFO L175 Difference]: Start difference. First operand has 331 places, 327 transitions, 672 flow. Second operand 3 states and 925 transitions. [2025-04-30 10:31:56,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 369 transitions, 960 flow [2025-04-30 10:31:56,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 369 transitions, 956 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:56,743 INFO L231 Difference]: Finished difference. Result has 335 places, 344 transitions, 838 flow [2025-04-30 10:31:56,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=335, PETRI_TRANSITIONS=344} [2025-04-30 10:31:56,744 INFO L279 CegarLoopForPetriNet]: 331 programPoint places, 4 predicate places. [2025-04-30 10:31:56,744 INFO L485 AbstractCegarLoop]: Abstraction has has 335 places, 344 transitions, 838 flow [2025-04-30 10:31:56,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-30 10:31:56,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:56,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:56,744 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:31:56,745 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2025-04-30 10:31:56,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1783851530, now seen corresponding path program 1 times [2025-04-30 10:31:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:56,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550588489] [2025-04-30 10:31:56,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:56,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:56,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-30 10:31:56,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-30 10:31:56,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:56,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:56,784 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-30 10:31:56,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:56,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550588489] [2025-04-30 10:31:56,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550588489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:56,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:56,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:56,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191016171] [2025-04-30 10:31:56,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:56,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:56,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:56,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:56,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:56,800 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 327 [2025-04-30 10:31:56,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 344 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-30 10:31:56,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:56,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 327 [2025-04-30 10:31:56,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:04,879 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1100] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [38#L691-3true, 214#L692-6true, 336#(= |#race~threads_alive~0| 0), Black: 334#true, 332#true, 244#L699-2true, 328#true, 339#true, 330#true, 261#L713-1true]) [2025-04-30 10:32:04,879 INFO L286 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-04-30 10:32:04,879 INFO L289 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-04-30 10:32:04,879 INFO L289 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-04-30 10:32:04,879 INFO L289 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-04-30 10:32:07,018 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1100] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [38#L691-3true, 214#L692-6true, 40#L699-6true, 336#(= |#race~threads_alive~0| 0), Black: 334#true, 332#true, 328#true, 339#true, 330#true, 261#L713-1true]) [2025-04-30 10:32:07,019 INFO L286 olderBase$Statistics]: this new event has 246 ancestors and is cut-off event [2025-04-30 10:32:07,019 INFO L289 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-04-30 10:32:07,019 INFO L289 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-04-30 10:32:07,019 INFO L289 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event