./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-8fc3dc6-m [2025-03-17 11:19:21,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:19:21,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:19:21,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:19:21,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:19:21,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:19:21,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:19:21,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:19:21,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:19:21,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:19:21,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:19:21,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:19:21,659 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:19:21,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:19:21,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:19:21,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:19:21,660 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:19:21,660 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:19:21,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:19:21,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:19:21,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:19:21,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:19:21,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:19:21,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:19:21,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:19:21,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:19:21,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:19:21,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:19:21,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:19:21,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:19:21,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:19:21,662 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-03-17 11:19:21,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:19:21,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:19:21,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:19:21,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:19:21,899 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:19:21,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i [2025-03-17 11:19:23,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e07d6aea/d819ea9b6a784cbc959078353d3af0a5/FLAG59c7b582b [2025-03-17 11:19:23,321 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:19:23,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i [2025-03-17 11:19:23,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e07d6aea/d819ea9b6a784cbc959078353d3af0a5/FLAG59c7b582b [2025-03-17 11:19:23,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e07d6aea/d819ea9b6a784cbc959078353d3af0a5 [2025-03-17 11:19:23,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:19:23,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:19:23,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:19:23,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:19:23,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:19:23,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66aa4b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23, skipping insertion in model container [2025-03-17 11:19:23,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:19:23,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:19:23,873 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:19:23,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:19:23,934 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:19:23,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23 WrapperNode [2025-03-17 11:19:23,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:19:23,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:19:23,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:19:23,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:19:23,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,961 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 179 [2025-03-17 11:19:23,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:19:23,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:19:23,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:19:23,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:19:23,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:19:23,987 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:19:23,987 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:19:23,987 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:19:23,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (1/1) ... [2025-03-17 11:19:23,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:19:23,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:19:24,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:19:24,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:19:24,028 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:19:24,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:19:24,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:19:24,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-17 11:19:24,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-17 11:19:24,028 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:19:24,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:19:24,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:19:24,029 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:19:24,114 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:19:24,116 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:19:24,326 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:19:24,326 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:19:24,349 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:19:24,349 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:19:24,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:19:24 BoogieIcfgContainer [2025-03-17 11:19:24,353 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:19:24,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:19:24,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:19:24,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:19:24,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:19:23" (1/3) ... [2025-03-17 11:19:24,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30455eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:19:24, skipping insertion in model container [2025-03-17 11:19:24,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:19:23" (2/3) ... [2025-03-17 11:19:24,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30455eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:19:24, skipping insertion in model container [2025-03-17 11:19:24,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:19:24" (3/3) ... [2025-03-17 11:19:24,361 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-inner-race-5.i [2025-03-17 11:19:24,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:19:24,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-inner-race-5.i that has 2 procedures, 230 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-17 11:19:24,373 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:19:24,429 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:19:24,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 233 transitions, 470 flow [2025-03-17 11:19:24,541 INFO L124 PetriNetUnfolderBase]: 5/259 cut-off events. [2025-03-17 11:19:24,543 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:19:24,549 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 190 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-03-17 11:19:24,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 233 transitions, 470 flow [2025-03-17 11:19:24,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 233 transitions, 470 flow [2025-03-17 11:19:24,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:19:24,585 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7eb5896f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:19:24,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 11:19:24,621 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:19:24,622 INFO L124 PetriNetUnfolderBase]: 2/165 cut-off events. [2025-03-17 11:19:24,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:19:24,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:24,623 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-03-17 11:19:24,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-03-17 11:19:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:24,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1924243754, now seen corresponding path program 1 times [2025-03-17 11:19:24,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:24,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834119464] [2025-03-17 11:19:24,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:24,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:24,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 11:19:24,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 11:19:24,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:24,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:19:24,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:24,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834119464] [2025-03-17 11:19:24,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834119464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:24,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:24,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:24,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436494372] [2025-03-17 11:19:24,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:24,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:25,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:25,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:25,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-03-17 11:19:25,033 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-03-17 11:19:25,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:25,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-03-17 11:19:25,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:25,183 INFO L124 PetriNetUnfolderBase]: 122/754 cut-off events. [2025-03-17 11:19:25,183 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:19:25,185 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 3270 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-03-17 11:19:25,189 INFO L140 encePairwiseOnDemand]: 222/233 looper letters, 28 selfloop transitions, 6 changer transitions 1/243 dead transitions. [2025-03-17 11:19:25,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 243 transitions, 558 flow [2025-03-17 11:19:25,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-03-17 11:19:25,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9542203147353362 [2025-03-17 11:19:25,206 INFO L175 Difference]: Start difference. First operand has 233 places, 233 transitions, 470 flow. Second operand 3 states and 667 transitions. [2025-03-17 11:19:25,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 243 transitions, 558 flow [2025-03-17 11:19:25,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 243 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:19:25,216 INFO L231 Difference]: Finished difference. Result has 235 places, 232 transitions, 502 flow [2025-03-17 11:19:25,218 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-03-17 11:19:25,220 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 2 predicate places. [2025-03-17 11:19:25,223 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 232 transitions, 502 flow [2025-03-17 11:19:25,223 INFO L472 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-03-17 11:19:25,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:25,223 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-03-17 11:19:25,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:19:25,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-03-17 11:19:25,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:25,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2140363218, now seen corresponding path program 1 times [2025-03-17 11:19:25,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:25,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84682325] [2025-03-17 11:19:25,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:25,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:25,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 11:19:25,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 11:19:25,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:25,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:19:25,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84682325] [2025-03-17 11:19:25,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84682325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:25,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:25,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:25,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601277052] [2025-03-17 11:19:25,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:25,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:25,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:25,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:25,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:25,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 233 [2025-03-17 11:19:25,378 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-03-17 11:19:25,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:25,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 233 [2025-03-17 11:19:25,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:25,483 INFO L124 PetriNetUnfolderBase]: 122/847 cut-off events. [2025-03-17 11:19:25,483 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-17 11:19:25,486 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 4131 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-03-17 11:19:25,488 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 19 selfloop transitions, 3 changer transitions 1/240 dead transitions. [2025-03-17 11:19:25,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 240 transitions, 564 flow [2025-03-17 11:19:25,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 672 transitions. [2025-03-17 11:19:25,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9613733905579399 [2025-03-17 11:19:25,491 INFO L175 Difference]: Start difference. First operand has 235 places, 232 transitions, 502 flow. Second operand 3 states and 672 transitions. [2025-03-17 11:19:25,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 240 transitions, 564 flow [2025-03-17 11:19:25,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 240 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:19:25,496 INFO L231 Difference]: Finished difference. Result has 236 places, 234 transitions, 512 flow [2025-03-17 11:19:25,496 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-03-17 11:19:25,497 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 3 predicate places. [2025-03-17 11:19:25,497 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 234 transitions, 512 flow [2025-03-17 11:19:25,497 INFO L472 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-03-17 11:19:25,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:25,498 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-03-17 11:19:25,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:19:25,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-03-17 11:19:25,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:25,500 INFO L85 PathProgramCache]: Analyzing trace with hash 537284425, now seen corresponding path program 1 times [2025-03-17 11:19:25,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:25,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223198768] [2025-03-17 11:19:25,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:25,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 11:19:25,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 11:19:25,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:25,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:19:25,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:25,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223198768] [2025-03-17 11:19:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223198768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:25,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963242985] [2025-03-17 11:19:25,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:25,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:25,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:25,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:25,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-03-17 11:19:25,631 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-03-17 11:19:25,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:25,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-03-17 11:19:25,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:25,757 INFO L124 PetriNetUnfolderBase]: 146/883 cut-off events. [2025-03-17 11:19:25,758 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-17 11:19:25,759 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 4247 event pairs, 73 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1150. Up to 267 conditions per place. [2025-03-17 11:19:25,760 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 26 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2025-03-17 11:19:25,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 242 transitions, 594 flow [2025-03-17 11:19:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2025-03-17 11:19:25,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456366237482118 [2025-03-17 11:19:25,762 INFO L175 Difference]: Start difference. First operand has 236 places, 234 transitions, 512 flow. Second operand 3 states and 661 transitions. [2025-03-17 11:19:25,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 242 transitions, 594 flow [2025-03-17 11:19:25,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 242 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:19:25,766 INFO L231 Difference]: Finished difference. Result has 238 places, 238 transitions, 548 flow [2025-03-17 11:19:25,766 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-03-17 11:19:25,767 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2025-03-17 11:19:25,767 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 238 transitions, 548 flow [2025-03-17 11:19:25,767 INFO L472 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-03-17 11:19:25,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:25,767 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-03-17 11:19:25,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:19:25,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-03-17 11:19:25,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:25,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1764643628, now seen corresponding path program 1 times [2025-03-17 11:19:25,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:25,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367964051] [2025-03-17 11:19:25,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:25,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:25,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 11:19:25,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 11:19:25,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:25,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:19:25,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:19:25,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 11:19:25,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 11:19:25,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:25,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:19:25,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:19:25,899 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:19:25,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-17 11:19:25,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-17 11:19:25,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-17 11:19:25,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-17 11:19:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-17 11:19:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-17 11:19:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-17 11:19:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-17 11:19:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-17 11:19:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-17 11:19:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-17 11:19:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-17 11:19:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-17 11:19:25,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:19:25,903 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:19:25,905 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:19:25,905 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:19:25,928 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:19:25,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 280 transitions, 570 flow [2025-03-17 11:19:25,962 INFO L124 PetriNetUnfolderBase]: 7/340 cut-off events. [2025-03-17 11:19:25,962 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:19:25,963 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 477 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-03-17 11:19:25,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 282 places, 280 transitions, 570 flow [2025-03-17 11:19:25,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 280 transitions, 570 flow [2025-03-17 11:19:25,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:19:25,966 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7eb5896f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:19:25,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 11:19:25,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:19:25,983 INFO L124 PetriNetUnfolderBase]: 2/165 cut-off events. [2025-03-17 11:19:25,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:19:25,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:25,984 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-03-17 11:19:25,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-17 11:19:25,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash -209766162, now seen corresponding path program 1 times [2025-03-17 11:19:25,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:25,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555728627] [2025-03-17 11:19:25,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:25,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 11:19:26,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 11:19:26,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:26,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:19:26,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555728627] [2025-03-17 11:19:26,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555728627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:26,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:26,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052350284] [2025-03-17 11:19:26,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:26,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:26,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:26,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:26,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:26,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 280 [2025-03-17 11:19:26,089 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-03-17 11:19:26,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:26,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 280 [2025-03-17 11:19:26,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:27,644 INFO L124 PetriNetUnfolderBase]: 4627/13176 cut-off events. [2025-03-17 11:19:27,644 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-17 11:19:27,676 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 131280 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-03-17 11:19:27,729 INFO L140 encePairwiseOnDemand]: 259/280 looper letters, 54 selfloop transitions, 14 changer transitions 1/309 dead transitions. [2025-03-17 11:19:27,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 309 transitions, 769 flow [2025-03-17 11:19:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2025-03-17 11:19:27,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511904761904761 [2025-03-17 11:19:27,732 INFO L175 Difference]: Start difference. First operand has 282 places, 280 transitions, 570 flow. Second operand 3 states and 799 transitions. [2025-03-17 11:19:27,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 309 transitions, 769 flow [2025-03-17 11:19:27,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 309 transitions, 769 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:19:27,736 INFO L231 Difference]: Finished difference. Result has 286 places, 291 transitions, 686 flow [2025-03-17 11:19:27,736 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-03-17 11:19:27,737 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 4 predicate places. [2025-03-17 11:19:27,737 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 291 transitions, 686 flow [2025-03-17 11:19:27,737 INFO L472 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-03-17 11:19:27,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:27,738 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-03-17 11:19:27,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:19:27,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-17 11:19:27,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:27,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1315596754, now seen corresponding path program 1 times [2025-03-17 11:19:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:27,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989973177] [2025-03-17 11:19:27,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:27,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:27,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 11:19:27,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 11:19:27,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:27,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:19:27,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:27,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989973177] [2025-03-17 11:19:27,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989973177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:27,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:27,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:27,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558675909] [2025-03-17 11:19:27,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:27,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:27,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:27,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:27,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 280 [2025-03-17 11:19:27,810 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-03-17 11:19:27,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:27,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 280 [2025-03-17 11:19:27,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:29,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [Black: 285#true, 281#true, 170#L699-6true, 16#L713-2true, 283#true, 290#true, 82#L699-1true, 287#(= |#race~threads_alive~0| 0)]) [2025-03-17 11:19:29,437 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-03-17 11:19:29,437 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-17 11:19:29,437 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-17 11:19:29,437 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-17 11:19:29,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [281#true, Black: 285#true, 283#true, 16#L713-2true, 290#true, 218#L699-7true, 82#L699-1true, 287#(= |#race~threads_alive~0| 0)]) [2025-03-17 11:19:29,451 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-17 11:19:29,451 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-17 11:19:29,451 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-17 11:19:29,451 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-17 11:19:29,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [281#true, Black: 285#true, 16#L713-2true, 283#true, 102#L699-1true, 290#true, 82#L699-1true, 287#(= |#race~threads_alive~0| 0)]) [2025-03-17 11:19:29,583 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-17 11:19:29,583 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-17 11:19:29,584 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-17 11:19:29,584 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-17 11:19:29,615 INFO L124 PetriNetUnfolderBase]: 4195/15297 cut-off events. [2025-03-17 11:19:29,615 INFO L125 PetriNetUnfolderBase]: For 824/865 co-relation queries the response was YES. [2025-03-17 11:19:29,651 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 426. Compared 173316 event pairs, 2308 based on Foata normal form. 0/13689 useless extension candidates. Maximal degree in co-relation 23033. Up to 4051 conditions per place. [2025-03-17 11:19:29,695 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 34 selfloop transitions, 4 changer transitions 0/306 dead transitions. [2025-03-17 11:19:29,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 306 transitions, 792 flow [2025-03-17 11:19:29,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2025-03-17 11:19:29,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571428571428572 [2025-03-17 11:19:29,697 INFO L175 Difference]: Start difference. First operand has 286 places, 291 transitions, 686 flow. Second operand 3 states and 804 transitions. [2025-03-17 11:19:29,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 306 transitions, 792 flow [2025-03-17 11:19:29,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 306 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:19:29,712 INFO L231 Difference]: Finished difference. Result has 287 places, 294 transitions, 688 flow [2025-03-17 11:19:29,713 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-03-17 11:19:29,714 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 5 predicate places. [2025-03-17 11:19:29,715 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 294 transitions, 688 flow [2025-03-17 11:19:29,715 INFO L472 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-03-17 11:19:29,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:29,716 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-03-17 11:19:29,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:19:29,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-17 11:19:29,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:29,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1007109873, now seen corresponding path program 1 times [2025-03-17 11:19:29,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:29,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144942816] [2025-03-17 11:19:29,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:29,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:29,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 11:19:29,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 11:19:29,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:29,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:19:29,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144942816] [2025-03-17 11:19:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144942816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:29,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:29,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:29,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793742194] [2025-03-17 11:19:29,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:29,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:29,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:29,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:29,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 280 [2025-03-17 11:19:29,823 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-03-17 11:19:29,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:29,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 280 [2025-03-17 11:19:29,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:30,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][239], [Black: 285#true, 38#L692-2true, 281#true, Black: 292#(= |#race~data~0| 0), 241#L692-7true, 16#L713-2true, 283#true, 290#true, 295#true]) [2025-03-17 11:19:30,040 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-03-17 11:19:30,040 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-17 11:19:30,040 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-17 11:19:30,040 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-17 11:19:30,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [281#true, Black: 285#true, 124#L694-3true, Black: 292#(= |#race~data~0| 0), 241#L692-7true, 283#true, 16#L713-2true, 290#true, 295#true]) [2025-03-17 11:19:30,189 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-03-17 11:19:30,190 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-17 11:19:30,190 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-17 11:19:30,190 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-17 11:19:30,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [281#true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 241#L692-7true, 224#L694true, 283#true, 16#L713-2true, 290#true, 295#true]) [2025-03-17 11:19:30,210 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-03-17 11:19:30,210 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-03-17 11:19:30,210 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-03-17 11:19:30,210 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-03-17 11:19:30,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [281#true, Black: 285#true, 235#L695true, Black: 292#(= |#race~data~0| 0), 241#L692-7true, 283#true, 16#L713-2true, 290#true, 295#true]) [2025-03-17 11:19:30,248 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2025-03-17 11:19:30,248 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-03-17 11:19:30,248 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-17 11:19:30,249 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-17 11:19:30,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [281#true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 241#L692-7true, 39#L697true, 283#true, 16#L713-2true, 290#true, 295#true]) [2025-03-17 11:19:30,596 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-03-17 11:19:30,596 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-03-17 11:19:30,596 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-17 11:19:30,596 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-17 11:19:30,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [281#true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 241#L692-7true, 283#true, 122#L698true, 16#L713-2true, 290#true, 295#true]) [2025-03-17 11:19:30,723 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-17 11:19:30,723 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-17 11:19:30,723 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-17 11:19:30,723 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-17 11:19:30,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][239], [Black: 285#true, 38#L692-2true, 281#true, 140#L699-7true, Black: 292#(= |#race~data~0| 0), 16#L713-2true, 283#true, 290#true, 295#true]) [2025-03-17 11:19:30,928 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-03-17 11:19:30,928 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-03-17 11:19:30,928 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-03-17 11:19:30,928 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-17 11:19:31,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [281#true, Black: 285#true, 140#L699-7true, 124#L694-3true, Black: 292#(= |#race~data~0| 0), 283#true, 16#L713-2true, 290#true, 295#true]) [2025-03-17 11:19:31,082 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-03-17 11:19:31,082 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-17 11:19:31,082 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-17 11:19:31,082 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-17 11:19:31,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [281#true, Black: 285#true, 140#L699-7true, Black: 292#(= |#race~data~0| 0), 224#L694true, 283#true, 16#L713-2true, 290#true, 295#true]) [2025-03-17 11:19:31,108 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-03-17 11:19:31,108 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-03-17 11:19:31,108 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-17 11:19:31,108 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-03-17 11:19:31,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [281#true, Black: 285#true, 140#L699-7true, 235#L695true, Black: 292#(= |#race~data~0| 0), 283#true, 16#L713-2true, 290#true, 295#true]) [2025-03-17 11:19:31,156 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-17 11:19:31,156 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-17 11:19:31,156 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-17 11:19:31,156 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-17 11:19:31,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [281#true, Black: 285#true, 140#L699-7true, Black: 292#(= |#race~data~0| 0), 283#true, 39#L697true, 16#L713-2true, 290#true, 295#true]) [2025-03-17 11:19:31,397 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-03-17 11:19:31,397 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:19:31,397 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-03-17 11:19:31,397 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-03-17 11:19:31,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [281#true, Black: 285#true, 140#L699-7true, Black: 292#(= |#race~data~0| 0), 283#true, 16#L713-2true, 122#L698true, 290#true, 295#true]) [2025-03-17 11:19:31,435 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2025-03-17 11:19:31,435 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-17 11:19:31,435 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-17 11:19:31,435 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-03-17 11:19:31,651 INFO L124 PetriNetUnfolderBase]: 5628/18178 cut-off events. [2025-03-17 11:19:31,651 INFO L125 PetriNetUnfolderBase]: For 2763/3030 co-relation queries the response was YES. [2025-03-17 11:19:31,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31893 conditions, 18178 events. 5628/18178 cut-off events. For 2763/3030 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 201210 event pairs, 2940 based on Foata normal form. 94/16426 useless extension candidates. Maximal degree in co-relation 25904. Up to 7546 conditions per place. [2025-03-17 11:19:31,751 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 49 selfloop transitions, 14 changer transitions 0/317 dead transitions. [2025-03-17 11:19:31,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 317 transitions, 885 flow [2025-03-17 11:19:31,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2025-03-17 11:19:31,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2025-03-17 11:19:31,753 INFO L175 Difference]: Start difference. First operand has 287 places, 294 transitions, 688 flow. Second operand 3 states and 791 transitions. [2025-03-17 11:19:31,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 317 transitions, 885 flow [2025-03-17 11:19:31,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 317 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:19:31,765 INFO L231 Difference]: Finished difference. Result has 289 places, 306 transitions, 806 flow [2025-03-17 11:19:31,765 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-03-17 11:19:31,766 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 7 predicate places. [2025-03-17 11:19:31,766 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 306 transitions, 806 flow [2025-03-17 11:19:31,766 INFO L472 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-03-17 11:19:31,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:31,766 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-03-17 11:19:31,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:19:31,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-17 11:19:31,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1409219307, now seen corresponding path program 1 times [2025-03-17 11:19:31,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:31,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106015991] [2025-03-17 11:19:31,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:31,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:31,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 11:19:31,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 11:19:31,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:31,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:19:31,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:31,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106015991] [2025-03-17 11:19:31,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106015991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:31,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:31,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:31,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618460844] [2025-03-17 11:19:31,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:31,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:31,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:31,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:31,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 280 [2025-03-17 11:19:31,852 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-03-17 11:19:31,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:31,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 280 [2025-03-17 11:19:31,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:32,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][234], [Black: 285#true, 38#L692-2true, 281#true, Black: 292#(= |#race~data~0| 0), 241#L692-7true, 16#L713-2true, 283#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 295#true]) [2025-03-17 11:19:32,103 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-03-17 11:19:32,103 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-17 11:19:32,103 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-17 11:19:32,103 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-17 11:19:32,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [Black: 285#true, 281#true, 124#L694-3true, Black: 292#(= |#race~data~0| 0), 241#L692-7true, 16#L713-2true, 283#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 295#true]) [2025-03-17 11:19:32,169 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-03-17 11:19:32,169 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-17 11:19:32,169 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-17 11:19:32,169 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-17 11:19:33,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([861] L699-8-->L699-6: Formula: (= 0 |v_#race~threads_alive~0_9|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_9|} AuxVars[] AssignedVars[#race~threads_alive~0][318], [38#L692-2true, Black: 285#true, 281#true, Black: 292#(= |#race~data~0| 0), 283#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 215#L699-6true, 223#L713-1true, 295#true]) [2025-03-17 11:19:33,039 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-03-17 11:19:33,039 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-17 11:19:33,039 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-03-17 11:19:33,039 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-03-17 11:19:33,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][234], [Black: 285#true, 38#L692-2true, 281#true, Black: 292#(= |#race~data~0| 0), 16#L713-2true, 283#true, 300#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 215#L699-6true, 295#true]) [2025-03-17 11:19:33,070 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2025-03-17 11:19:33,070 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2025-03-17 11:19:33,070 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2025-03-17 11:19:33,070 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2025-03-17 11:19:33,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][234], [38#L692-2true, 281#true, Black: 285#true, 140#L699-7true, Black: 292#(= |#race~data~0| 0), 16#L713-2true, 283#true, 300#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 295#true]) [2025-03-17 11:19:33,070 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-03-17 11:19:33,070 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-03-17 11:19:33,070 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-17 11:19:33,070 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-03-17 11:19:33,071 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][234], [Black: 285#true, 38#L692-2true, 281#true, 140#L699-7true, Black: 292#(= |#race~data~0| 0), 16#L713-2true, 283#true, 300#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 295#true]) [2025-03-17 11:19:33,071 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-03-17 11:19:33,071 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-03-17 11:19:33,071 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-17 11:19:33,071 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-03-17 11:19:33,071 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-17 11:19:33,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [Black: 285#true, 281#true, 140#L699-7true, Black: 292#(= |#race~data~0| 0), 16#L713-2true, 283#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 105#threadErr3ASSERT_VIOLATIONDATA_RACEtrue, 295#true]) [2025-03-17 11:19:33,129 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-03-17 11:19:33,129 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-03-17 11:19:33,129 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-17 11:19:33,129 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-17 11:19:33,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L713-->L713-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][175], [Black: 285#true, 281#true, 140#L699-7true, 124#L694-3true, Black: 292#(= |#race~data~0| 0), 16#L713-2true, 283#true, 300#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 295#true]) [2025-03-17 11:19:33,135 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-03-17 11:19:33,135 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-17 11:19:33,135 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-17 11:19:33,135 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-17 11:19:33,751 INFO L124 PetriNetUnfolderBase]: 5599/20226 cut-off events. [2025-03-17 11:19:33,751 INFO L125 PetriNetUnfolderBase]: For 3183/3543 co-relation queries the response was YES. [2025-03-17 11:19:33,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34706 conditions, 20226 events. 5599/20226 cut-off events. For 3183/3543 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 239429 event pairs, 3099 based on Foata normal form. 21/18179 useless extension candidates. Maximal degree in co-relation 33125. Up to 6066 conditions per place. [2025-03-17 11:19:33,856 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 36 selfloop transitions, 7 changer transitions 0/322 dead transitions. [2025-03-17 11:19:33,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 322 transitions, 935 flow [2025-03-17 11:19:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2025-03-17 11:19:34,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-17 11:19:34,068 INFO L175 Difference]: Start difference. First operand has 289 places, 306 transitions, 806 flow. Second operand 3 states and 800 transitions. [2025-03-17 11:19:34,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 322 transitions, 935 flow [2025-03-17 11:19:34,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 322 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:19:34,078 INFO L231 Difference]: Finished difference. Result has 291 places, 311 transitions, 834 flow [2025-03-17 11:19:34,079 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-03-17 11:19:34,079 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 9 predicate places. [2025-03-17 11:19:34,079 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 311 transitions, 834 flow [2025-03-17 11:19:34,080 INFO L472 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-03-17 11:19:34,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:34,080 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-03-17 11:19:34,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:19:34,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-17 11:19:34,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1726460647, now seen corresponding path program 1 times [2025-03-17 11:19:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033730133] [2025-03-17 11:19:34,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:34,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 11:19:34,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 11:19:34,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:34,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:19:34,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:34,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033730133] [2025-03-17 11:19:34,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033730133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:34,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:34,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:19:34,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028740902] [2025-03-17 11:19:34,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:34,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:34,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:34,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:34,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:34,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 280 [2025-03-17 11:19:34,245 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-03-17 11:19:34,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:34,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 280 [2025-03-17 11:19:34,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:35,314 INFO L124 PetriNetUnfolderBase]: 1939/10763 cut-off events. [2025-03-17 11:19:35,314 INFO L125 PetriNetUnfolderBase]: For 1679/1960 co-relation queries the response was YES. [2025-03-17 11:19:35,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17785 conditions, 10763 events. 1939/10763 cut-off events. For 1679/1960 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 127722 event pairs, 546 based on Foata normal form. 260/10107 useless extension candidates. Maximal degree in co-relation 16781. Up to 1517 conditions per place. [2025-03-17 11:19:35,363 INFO L140 encePairwiseOnDemand]: 266/280 looper letters, 16 selfloop transitions, 14 changer transitions 0/318 dead transitions. [2025-03-17 11:19:35,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 318 transitions, 897 flow [2025-03-17 11:19:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2025-03-17 11:19:35,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9678571428571429 [2025-03-17 11:19:35,365 INFO L175 Difference]: Start difference. First operand has 291 places, 311 transitions, 834 flow. Second operand 3 states and 813 transitions. [2025-03-17 11:19:35,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 318 transitions, 897 flow [2025-03-17 11:19:35,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 318 transitions, 883 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:19:35,376 INFO L231 Difference]: Finished difference. Result has 292 places, 315 transitions, 870 flow [2025-03-17 11:19:35,377 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-03-17 11:19:35,379 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 10 predicate places. [2025-03-17 11:19:35,379 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 315 transitions, 870 flow [2025-03-17 11:19:35,380 INFO L472 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-03-17 11:19:35,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:35,381 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-03-17 11:19:35,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:19:35,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-17 11:19:35,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash 854619089, now seen corresponding path program 1 times [2025-03-17 11:19:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:35,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728895578] [2025-03-17 11:19:35,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:35,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:35,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 11:19:35,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 11:19:35,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:35,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:19:35,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:35,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728895578] [2025-03-17 11:19:35,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728895578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:35,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:35,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:35,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394604259] [2025-03-17 11:19:35,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:35,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:35,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:35,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:35,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:35,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 280 [2025-03-17 11:19:35,513 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-03-17 11:19:35,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:35,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 280 [2025-03-17 11:19:35,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:36,672 INFO L124 PetriNetUnfolderBase]: 3011/13203 cut-off events. [2025-03-17 11:19:36,672 INFO L125 PetriNetUnfolderBase]: For 6930/7567 co-relation queries the response was YES. [2025-03-17 11:19:36,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27760 conditions, 13203 events. 3011/13203 cut-off events. For 6930/7567 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 154997 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-03-17 11:19:36,736 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 60 selfloop transitions, 10 changer transitions 0/331 dead transitions. [2025-03-17 11:19:36,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 331 transitions, 1079 flow [2025-03-17 11:19:36,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2025-03-17 11:19:36,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357142857142857 [2025-03-17 11:19:36,738 INFO L175 Difference]: Start difference. First operand has 292 places, 315 transitions, 870 flow. Second operand 3 states and 786 transitions. [2025-03-17 11:19:36,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 331 transitions, 1079 flow [2025-03-17 11:19:36,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 331 transitions, 1058 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:19:36,746 INFO L231 Difference]: Finished difference. Result has 295 places, 323 transitions, 946 flow [2025-03-17 11:19:36,747 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-03-17 11:19:36,747 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 13 predicate places. [2025-03-17 11:19:36,747 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 323 transitions, 946 flow [2025-03-17 11:19:36,748 INFO L472 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-03-17 11:19:36,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:36,748 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-03-17 11:19:36,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:19:36,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-17 11:19:36,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:36,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1924761910, now seen corresponding path program 1 times [2025-03-17 11:19:36,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:36,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174413895] [2025-03-17 11:19:36,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:36,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 11:19:36,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 11:19:36,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:36,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:19:36,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:19:36,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 11:19:36,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 11:19:36,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:36,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:19:36,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:19:36,821 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:19:36,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-17 11:19:36,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-17 11:19:36,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-17 11:19:36,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-17 11:19:36,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-17 11:19:36,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-17 11:19:36,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-17 11:19:36,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-17 11:19:36,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-17 11:19:36,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-17 11:19:36,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-17 11:19:36,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-17 11:19:36,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-17 11:19:36,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-17 11:19:36,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-17 11:19:36,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-17 11:19:36,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-17 11:19:36,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-17 11:19:36,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:19:36,823 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:19:36,823 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:19:36,823 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 11:19:36,850 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:19:36,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 327 transitions, 672 flow [2025-03-17 11:19:36,881 INFO L124 PetriNetUnfolderBase]: 9/421 cut-off events. [2025-03-17 11:19:36,881 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 11:19:36,883 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 811 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-03-17 11:19:36,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 327 transitions, 672 flow [2025-03-17 11:19:36,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 331 places, 327 transitions, 672 flow [2025-03-17 11:19:36,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:19:36,888 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7eb5896f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:19:36,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-17 11:19:36,896 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:19:36,897 INFO L124 PetriNetUnfolderBase]: 2/165 cut-off events. [2025-03-17 11:19:36,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:19:36,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:36,897 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-03-17 11:19:36,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2025-03-17 11:19:36,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:36,898 INFO L85 PathProgramCache]: Analyzing trace with hash 197225173, now seen corresponding path program 1 times [2025-03-17 11:19:36,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:36,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977403857] [2025-03-17 11:19:36,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:36,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:36,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 11:19:36,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 11:19:36,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:36,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:19:36,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:36,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977403857] [2025-03-17 11:19:36,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977403857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:36,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:36,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:36,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043591096] [2025-03-17 11:19:36,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:36,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:36,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:36,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:36,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:36,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 327 [2025-03-17 11:19:36,985 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-03-17 11:19:36,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:36,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 327 [2025-03-17 11:19:36,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:02,127 INFO L124 PetriNetUnfolderBase]: 119918/257925 cut-off events. [2025-03-17 11:20:02,127 INFO L125 PetriNetUnfolderBase]: For 1618/1618 co-relation queries the response was YES. [2025-03-17 11:20:02,802 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 5108. Compared 3351999 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-03-17 11:20:03,805 INFO L140 encePairwiseOnDemand]: 298/327 looper letters, 76 selfloop transitions, 20 changer transitions 1/369 dead transitions. [2025-03-17 11:20:03,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 369 transitions, 960 flow [2025-03-17 11:20:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:20:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:20:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-03-17 11:20:03,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9429153924566769 [2025-03-17 11:20:03,807 INFO L175 Difference]: Start difference. First operand has 331 places, 327 transitions, 672 flow. Second operand 3 states and 925 transitions. [2025-03-17 11:20:03,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 369 transitions, 960 flow [2025-03-17 11:20:03,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 369 transitions, 956 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:03,811 INFO L231 Difference]: Finished difference. Result has 335 places, 344 transitions, 838 flow [2025-03-17 11:20:03,812 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-03-17 11:20:03,812 INFO L279 CegarLoopForPetriNet]: 331 programPoint places, 4 predicate places. [2025-03-17 11:20:03,812 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 344 transitions, 838 flow [2025-03-17 11:20:03,813 INFO L472 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-03-17 11:20:03,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:03,813 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-03-17 11:20:03,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:20:03,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2025-03-17 11:20:03,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:03,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1395450834, now seen corresponding path program 1 times [2025-03-17 11:20:03,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:03,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753128294] [2025-03-17 11:20:03,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:03,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:03,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 11:20:03,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 11:20:03,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:03,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:04,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753128294] [2025-03-17 11:20:04,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753128294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:04,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:04,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:20:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954787974] [2025-03-17 11:20:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:04,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:20:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:04,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:20:04,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:20:04,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 327 [2025-03-17 11:20:04,047 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-03-17 11:20:04,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:04,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 327 [2025-03-17 11:20:04,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand