./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.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-lit/sssc12.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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:59:01,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:59:01,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:59:01,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:59:01,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:59:01,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:59:01,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:59:01,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:59:01,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:59:01,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:59:01,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:59:01,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:59:01,976 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:59:01,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:59:01,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:59:01,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:59:01,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:59:01,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:59:01,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:59:01,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:59:01,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:59:01,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:59:01,978 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:59:01,978 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:59:01,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:59:01,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:59:01,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:59:01,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:59:01,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:59:01,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:59:01,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:59:01,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:59:01,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:59:01,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:59:01,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:59:01,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:59:01,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:59:01,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:59:01,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:59:01,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:59:01,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:59:01,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:59:01,979 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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-03-17 10:59:02,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:59:02,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:59:02,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:59:02,215 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:59:02,216 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:59:02,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-17 10:59:03,418 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7fd923a1/6e0eb184c6764664a0e9f96b140a71d1/FLAGb2aad0c69 [2025-03-17 10:59:03,767 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:59:03,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-17 10:59:03,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7fd923a1/6e0eb184c6764664a0e9f96b140a71d1/FLAGb2aad0c69 [2025-03-17 10:59:04,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7fd923a1/6e0eb184c6764664a0e9f96b140a71d1 [2025-03-17 10:59:04,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:59:04,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:59:04,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:04,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:59:04,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:59:04,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04, skipping insertion in model container [2025-03-17 10:59:04,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:59:04,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:04,325 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:59:04,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:04,425 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:59:04,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04 WrapperNode [2025-03-17 10:59:04,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:04,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:04,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:59:04,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:59:04,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,473 INFO L138 Inliner]: procedures = 272, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2025-03-17 10:59:04,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:04,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:59:04,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:59:04,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:59:04,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:59:04,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:59:04,504 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:59:04,504 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:59:04,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (1/1) ... [2025-03-17 10:59:04,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:59:04,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:59:04,529 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 10:59:04,531 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 10:59:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-03-17 10:59:04,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-03-17 10:59:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 10:59:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:59:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 10:59:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:59:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:59:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:59:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:59:04,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:59:04,547 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 10:59:04,645 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:59:04,647 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:59:04,890 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:59:04,890 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:59:04,910 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:59:04,910 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:59:04,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:04 BoogieIcfgContainer [2025-03-17 10:59:04,910 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:59:04,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:59:04,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:59:04,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:59:04,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:59:04" (1/3) ... [2025-03-17 10:59:04,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb1d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:04, skipping insertion in model container [2025-03-17 10:59:04,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:04" (2/3) ... [2025-03-17 10:59:04,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb1d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:04, skipping insertion in model container [2025-03-17 10:59:04,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:04" (3/3) ... [2025-03-17 10:59:04,919 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-03-17 10:59:04,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:59:04,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 138 locations, 1 initial locations, 2 loop locations, and 14 error locations. [2025-03-17 10:59:04,933 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:59:05,004 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:59:05,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 145 transitions, 294 flow [2025-03-17 10:59:05,092 INFO L124 PetriNetUnfolderBase]: 7/153 cut-off events. [2025-03-17 10:59:05,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:59:05,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 153 events. 7/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 159 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2025-03-17 10:59:05,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 145 transitions, 294 flow [2025-03-17 10:59:05,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 145 transitions, 294 flow [2025-03-17 10:59:05,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:59:05,120 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;@3362110e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:59:05,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-17 10:59:05,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:59:05,125 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-17 10:59:05,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:59:05,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:05,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:05,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:05,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:05,130 INFO L85 PathProgramCache]: Analyzing trace with hash -922582197, now seen corresponding path program 1 times [2025-03-17 10:59:05,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:05,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218740498] [2025-03-17 10:59:05,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:05,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:05,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 10:59:05,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 10:59:05,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:05,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:05,274 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 10:59:05,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:05,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218740498] [2025-03-17 10:59:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218740498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:05,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:05,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300347062] [2025-03-17 10:59:05,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:05,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:05,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:05,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:05,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 145 [2025-03-17 10:59:05,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 145 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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 10:59:05,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:05,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 145 [2025-03-17 10:59:05,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:05,371 INFO L124 PetriNetUnfolderBase]: 4/137 cut-off events. [2025-03-17 10:59:05,371 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:59:05,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 137 events. 4/137 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 11/129 useless extension candidates. Maximal degree in co-relation 76. Up to 11 conditions per place. [2025-03-17 10:59:05,379 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 10 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-03-17 10:59:05,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 296 flow [2025-03-17 10:59:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:05,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-03-17 10:59:05,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-03-17 10:59:05,391 INFO L175 Difference]: Start difference. First operand has 141 places, 145 transitions, 294 flow. Second operand 3 states and 395 transitions. [2025-03-17 10:59:05,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 296 flow [2025-03-17 10:59:05,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 134 transitions, 296 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:05,415 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 274 flow [2025-03-17 10:59:05,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-03-17 10:59:05,421 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -6 predicate places. [2025-03-17 10:59:05,423 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 274 flow [2025-03-17 10:59:05,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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 10:59:05,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:05,424 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] [2025-03-17 10:59:05,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:59:05,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:05,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1067909762, now seen corresponding path program 1 times [2025-03-17 10:59:05,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:05,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702436604] [2025-03-17 10:59:05,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:05,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:05,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 10:59:05,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 10:59:05,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:05,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:05,515 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 10:59:05,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:05,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702436604] [2025-03-17 10:59:05,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702436604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:05,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:05,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479504166] [2025-03-17 10:59:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:05,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:05,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:05,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:05,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 145 [2025-03-17 10:59:05,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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 10:59:05,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:05,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 145 [2025-03-17 10:59:05,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:05,604 INFO L124 PetriNetUnfolderBase]: 4/135 cut-off events. [2025-03-17 10:59:05,604 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:59:05,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 135 events. 4/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 125. Up to 12 conditions per place. [2025-03-17 10:59:05,605 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 11 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2025-03-17 10:59:05,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 132 transitions, 298 flow [2025-03-17 10:59:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-03-17 10:59:05,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8942528735632184 [2025-03-17 10:59:05,607 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 274 flow. Second operand 3 states and 389 transitions. [2025-03-17 10:59:05,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 132 transitions, 298 flow [2025-03-17 10:59:05,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 132 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:05,614 INFO L231 Difference]: Finished difference. Result has 133 places, 132 transitions, 272 flow [2025-03-17 10:59:05,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=133, PETRI_TRANSITIONS=132} [2025-03-17 10:59:05,616 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2025-03-17 10:59:05,616 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 132 transitions, 272 flow [2025-03-17 10:59:05,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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 10:59:05,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:05,618 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] [2025-03-17 10:59:05,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:59:05,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:05,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash -925270893, now seen corresponding path program 1 times [2025-03-17 10:59:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:05,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308988073] [2025-03-17 10:59:05,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:05,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 10:59:05,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 10:59:05,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:05,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:05,678 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 10:59:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:05,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308988073] [2025-03-17 10:59:05,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308988073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:05,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:05,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:05,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965530320] [2025-03-17 10:59:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:05,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:05,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:05,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:05,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 145 [2025-03-17 10:59:05,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 132 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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 10:59:05,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:05,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 145 [2025-03-17 10:59:05,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:05,740 INFO L124 PetriNetUnfolderBase]: 4/130 cut-off events. [2025-03-17 10:59:05,740 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:59:05,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 130 events. 4/130 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 113. Up to 13 conditions per place. [2025-03-17 10:59:05,741 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 13 selfloop transitions, 1 changer transitions 0/127 dead transitions. [2025-03-17 10:59:05,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 127 transitions, 290 flow [2025-03-17 10:59:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-03-17 10:59:05,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781609195402299 [2025-03-17 10:59:05,743 INFO L175 Difference]: Start difference. First operand has 133 places, 132 transitions, 272 flow. Second operand 3 states and 382 transitions. [2025-03-17 10:59:05,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 127 transitions, 290 flow [2025-03-17 10:59:05,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 127 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:05,746 INFO L231 Difference]: Finished difference. Result has 128 places, 127 transitions, 260 flow [2025-03-17 10:59:05,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2025-03-17 10:59:05,746 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2025-03-17 10:59:05,747 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 260 flow [2025-03-17 10:59:05,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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 10:59:05,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:05,747 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] [2025-03-17 10:59:05,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:59:05,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:05,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:05,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1651561028, now seen corresponding path program 1 times [2025-03-17 10:59:05,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:05,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809082320] [2025-03-17 10:59:05,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:05,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:05,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:59:05,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:59:05,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:05,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:05,832 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 10:59:05,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:05,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809082320] [2025-03-17 10:59:05,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809082320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:05,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:05,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:05,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161774395] [2025-03-17 10:59:05,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:05,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:05,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:05,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:05,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:05,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 145 [2025-03-17 10:59:05,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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 10:59:05,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:05,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 145 [2025-03-17 10:59:05,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:05,878 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2025-03-17 10:59:05,879 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:59:05,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 129 events. 4/129 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 106. Up to 8 conditions per place. [2025-03-17 10:59:05,879 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 7 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2025-03-17 10:59:05,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 126 transitions, 276 flow [2025-03-17 10:59:05,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2025-03-17 10:59:05,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9126436781609195 [2025-03-17 10:59:05,882 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 260 flow. Second operand 3 states and 397 transitions. [2025-03-17 10:59:05,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 126 transitions, 276 flow [2025-03-17 10:59:05,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 126 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:59:05,884 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 261 flow [2025-03-17 10:59:05,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2025-03-17 10:59:05,887 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2025-03-17 10:59:05,887 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 261 flow [2025-03-17 10:59:05,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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 10:59:05,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:05,888 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 10:59:05,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:59:05,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:05,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1459048540, now seen corresponding path program 1 times [2025-03-17 10:59:05,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:05,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903397104] [2025-03-17 10:59:05,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:05,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 10:59:05,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 10:59:05,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:05,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:06,009 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 10:59:06,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:06,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903397104] [2025-03-17 10:59:06,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903397104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:06,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:06,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:06,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195315044] [2025-03-17 10:59:06,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:06,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:59:06,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:06,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:59:06,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:59:06,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 145 [2025-03-17 10:59:06,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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 10:59:06,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:06,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 145 [2025-03-17 10:59:06,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:06,097 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2025-03-17 10:59:06,097 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:59:06,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 132 events. 3/132 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 120. Up to 15 conditions per place. [2025-03-17 10:59:06,098 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 14 selfloop transitions, 0 changer transitions 4/129 dead transitions. [2025-03-17 10:59:06,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 303 flow [2025-03-17 10:59:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:59:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 10:59:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2025-03-17 10:59:06,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8744827586206897 [2025-03-17 10:59:06,100 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 261 flow. Second operand 5 states and 634 transitions. [2025-03-17 10:59:06,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 303 flow [2025-03-17 10:59:06,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 129 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:06,102 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 261 flow [2025-03-17 10:59:06,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2025-03-17 10:59:06,103 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2025-03-17 10:59:06,103 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 261 flow [2025-03-17 10:59:06,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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 10:59:06,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:06,104 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 10:59:06,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:59:06,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:06,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash 830866084, now seen corresponding path program 1 times [2025-03-17 10:59:06,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:06,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207485858] [2025-03-17 10:59:06,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:06,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:06,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:59:06,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:59:06,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:06,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:59:06,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:59:06,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:59:06,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:59:06,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:06,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:59:06,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:59:06,152 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:59:06,152 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-17 10:59:06,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-17 10:59:06,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-17 10:59:06,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-17 10:59:06,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-17 10:59:06,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:59:06,155 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 10:59:06,157 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:59:06,157 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 10:59:06,209 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:59:06,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 215 transitions, 440 flow [2025-03-17 10:59:06,238 INFO L124 PetriNetUnfolderBase]: 12/233 cut-off events. [2025-03-17 10:59:06,238 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:59:06,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 233 events. 12/233 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 510 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 154. Up to 3 conditions per place. [2025-03-17 10:59:06,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 215 transitions, 440 flow [2025-03-17 10:59:06,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 215 transitions, 440 flow [2025-03-17 10:59:06,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:59:06,245 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;@3362110e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:59:06,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-17 10:59:06,247 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:59:06,247 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-17 10:59:06,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:59:06,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:06,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:06,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-17 10:59:06,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:06,248 INFO L85 PathProgramCache]: Analyzing trace with hash 28858498, now seen corresponding path program 1 times [2025-03-17 10:59:06,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:06,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520256670] [2025-03-17 10:59:06,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:06,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:06,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 10:59:06,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 10:59:06,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:06,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:06,272 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 10:59:06,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:06,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520256670] [2025-03-17 10:59:06,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520256670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:06,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:06,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355264695] [2025-03-17 10:59:06,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:06,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:06,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:06,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:06,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:06,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2025-03-17 10:59:06,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 215 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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 10:59:06,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:06,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2025-03-17 10:59:06,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:06,393 INFO L124 PetriNetUnfolderBase]: 70/670 cut-off events. [2025-03-17 10:59:06,393 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 10:59:06,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 670 events. 70/670 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3820 event pairs, 42 based on Foata normal form. 84/639 useless extension candidates. Maximal degree in co-relation 615. Up to 102 conditions per place. [2025-03-17 10:59:06,400 INFO L140 encePairwiseOnDemand]: 206/215 looper letters, 17 selfloop transitions, 2 changer transitions 1/200 dead transitions. [2025-03-17 10:59:06,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 200 transitions, 448 flow [2025-03-17 10:59:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2025-03-17 10:59:06,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054263565891473 [2025-03-17 10:59:06,404 INFO L175 Difference]: Start difference. First operand has 208 places, 215 transitions, 440 flow. Second operand 3 states and 584 transitions. [2025-03-17 10:59:06,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 200 transitions, 448 flow [2025-03-17 10:59:06,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 200 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:06,407 INFO L231 Difference]: Finished difference. Result has 200 places, 199 transitions, 412 flow [2025-03-17 10:59:06,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=200, PETRI_TRANSITIONS=199} [2025-03-17 10:59:06,408 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -8 predicate places. [2025-03-17 10:59:06,409 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 199 transitions, 412 flow [2025-03-17 10:59:06,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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 10:59:06,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:06,410 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] [2025-03-17 10:59:06,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:59:06,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-17 10:59:06,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash -701327202, now seen corresponding path program 1 times [2025-03-17 10:59:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025979376] [2025-03-17 10:59:06,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:06,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 10:59:06,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 10:59:06,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:06,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:06,445 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 10:59:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025979376] [2025-03-17 10:59:06,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025979376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:06,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:06,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:06,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16424824] [2025-03-17 10:59:06,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:06,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:06,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:06,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:06,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:06,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2025-03-17 10:59:06,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 199 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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 10:59:06,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:06,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2025-03-17 10:59:06,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:06,538 INFO L124 PetriNetUnfolderBase]: 42/526 cut-off events. [2025-03-17 10:59:06,539 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-17 10:59:06,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 526 events. 42/526 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2595 event pairs, 20 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 576. Up to 57 conditions per place. [2025-03-17 10:59:06,554 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 16 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-03-17 10:59:06,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 198 transitions, 446 flow [2025-03-17 10:59:06,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2025-03-17 10:59:06,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8992248062015504 [2025-03-17 10:59:06,556 INFO L175 Difference]: Start difference. First operand has 200 places, 199 transitions, 412 flow. Second operand 3 states and 580 transitions. [2025-03-17 10:59:06,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 198 transitions, 446 flow [2025-03-17 10:59:06,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 198 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:06,559 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 410 flow [2025-03-17 10:59:06,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2025-03-17 10:59:06,560 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -10 predicate places. [2025-03-17 10:59:06,560 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 410 flow [2025-03-17 10:59:06,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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 10:59:06,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:06,561 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] [2025-03-17 10:59:06,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:59:06,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-17 10:59:06,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash -728398477, now seen corresponding path program 1 times [2025-03-17 10:59:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:06,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14292558] [2025-03-17 10:59:06,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:06,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:06,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 10:59:06,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 10:59:06,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:06,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:06,583 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 10:59:06,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:06,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14292558] [2025-03-17 10:59:06,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14292558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:06,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:06,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:06,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623887258] [2025-03-17 10:59:06,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:06,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:06,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:06,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:06,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 215 [2025-03-17 10:59:06,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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 10:59:06,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:06,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 215 [2025-03-17 10:59:06,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:06,679 INFO L124 PetriNetUnfolderBase]: 82/808 cut-off events. [2025-03-17 10:59:06,680 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 10:59:06,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 808 events. 82/808 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4765 event pairs, 42 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 908. Up to 109 conditions per place. [2025-03-17 10:59:06,687 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 20 selfloop transitions, 1 changer transitions 0/191 dead transitions. [2025-03-17 10:59:06,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 191 transitions, 438 flow [2025-03-17 10:59:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2025-03-17 10:59:06,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2025-03-17 10:59:06,689 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 410 flow. Second operand 3 states and 565 transitions. [2025-03-17 10:59:06,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 191 transitions, 438 flow [2025-03-17 10:59:06,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 191 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:06,691 INFO L231 Difference]: Finished difference. Result has 191 places, 191 transitions, 394 flow [2025-03-17 10:59:06,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=191, PETRI_TRANSITIONS=191} [2025-03-17 10:59:06,693 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -17 predicate places. [2025-03-17 10:59:06,694 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 191 transitions, 394 flow [2025-03-17 10:59:06,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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 10:59:06,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:06,694 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] [2025-03-17 10:59:06,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:59:06,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-17 10:59:06,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1680485852, now seen corresponding path program 1 times [2025-03-17 10:59:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12291119] [2025-03-17 10:59:06,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:06,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:06,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:59:06,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:59:06,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:06,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:06,733 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 10:59:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12291119] [2025-03-17 10:59:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12291119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:06,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:06,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:06,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079478368] [2025-03-17 10:59:06,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:06,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:06,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:06,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:06,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 215 [2025-03-17 10:59:06,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 191 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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 10:59:06,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:06,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 215 [2025-03-17 10:59:06,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:06,800 INFO L124 PetriNetUnfolderBase]: 31/442 cut-off events. [2025-03-17 10:59:06,800 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 10:59:06,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 442 events. 31/442 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1869 event pairs, 12 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 459. Up to 36 conditions per place. [2025-03-17 10:59:06,804 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 11 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-03-17 10:59:06,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 190 transitions, 418 flow [2025-03-17 10:59:06,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2025-03-17 10:59:06,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2025-03-17 10:59:06,806 INFO L175 Difference]: Start difference. First operand has 191 places, 191 transitions, 394 flow. Second operand 3 states and 590 transitions. [2025-03-17 10:59:06,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 190 transitions, 418 flow [2025-03-17 10:59:06,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 190 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:59:06,809 INFO L231 Difference]: Finished difference. Result has 191 places, 190 transitions, 395 flow [2025-03-17 10:59:06,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=191, PETRI_TRANSITIONS=190} [2025-03-17 10:59:06,810 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -17 predicate places. [2025-03-17 10:59:06,811 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 190 transitions, 395 flow [2025-03-17 10:59:06,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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 10:59:06,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:06,812 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] [2025-03-17 10:59:06,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:59:06,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-17 10:59:06,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:06,814 INFO L85 PathProgramCache]: Analyzing trace with hash -10121130, now seen corresponding path program 1 times [2025-03-17 10:59:06,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:06,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148206422] [2025-03-17 10:59:06,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:06,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:06,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:59:06,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:59:06,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:06,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:06,870 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 10:59:06,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:06,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148206422] [2025-03-17 10:59:06,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148206422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:06,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:06,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:06,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903792960] [2025-03-17 10:59:06,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:06,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:06,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:06,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:06,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:06,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 215 [2025-03-17 10:59:06,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 190 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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 10:59:06,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:06,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 215 [2025-03-17 10:59:06,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:07,083 INFO L124 PetriNetUnfolderBase]: 195/1595 cut-off events. [2025-03-17 10:59:07,084 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-17 10:59:07,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1925 conditions, 1595 events. 195/1595 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12518 event pairs, 57 based on Foata normal form. 0/1384 useless extension candidates. Maximal degree in co-relation 1885. Up to 204 conditions per place. [2025-03-17 10:59:07,098 INFO L140 encePairwiseOnDemand]: 195/215 looper letters, 32 selfloop transitions, 14 changer transitions 0/209 dead transitions. [2025-03-17 10:59:07,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 209 transitions, 530 flow [2025-03-17 10:59:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2025-03-17 10:59:07,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178294573643411 [2025-03-17 10:59:07,100 INFO L175 Difference]: Start difference. First operand has 191 places, 190 transitions, 395 flow. Second operand 3 states and 592 transitions. [2025-03-17 10:59:07,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 209 transitions, 530 flow [2025-03-17 10:59:07,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 209 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:07,104 INFO L231 Difference]: Finished difference. Result has 193 places, 204 transitions, 515 flow [2025-03-17 10:59:07,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=193, PETRI_TRANSITIONS=204} [2025-03-17 10:59:07,105 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -15 predicate places. [2025-03-17 10:59:07,105 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 204 transitions, 515 flow [2025-03-17 10:59:07,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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 10:59:07,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:07,106 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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] [2025-03-17 10:59:07,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:59:07,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-17 10:59:07,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:07,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1070423301, now seen corresponding path program 1 times [2025-03-17 10:59:07,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:07,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-17 10:59:07,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:07,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:07,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:59:07,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:59:07,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:07,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:07,209 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 10:59:07,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:07,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-17 10:59:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452200728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:07,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:07,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:07,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406490952] [2025-03-17 10:59:07,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:07,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:59:07,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:07,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:59:07,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:59:07,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2025-03-17 10:59:07,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 204 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 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 10:59:07,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:07,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2025-03-17 10:59:07,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:07,404 INFO L124 PetriNetUnfolderBase]: 130/1492 cut-off events. [2025-03-17 10:59:07,404 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-17 10:59:07,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 1492 events. 130/1492 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 11560 event pairs, 41 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 1724. Up to 120 conditions per place. [2025-03-17 10:59:07,415 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 17 selfloop transitions, 0 changer transitions 4/207 dead transitions. [2025-03-17 10:59:07,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 207 transitions, 563 flow [2025-03-17 10:59:07,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:59:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 10:59:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 957 transitions. [2025-03-17 10:59:07,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8902325581395348 [2025-03-17 10:59:07,417 INFO L175 Difference]: Start difference. First operand has 193 places, 204 transitions, 515 flow. Second operand 5 states and 957 transitions. [2025-03-17 10:59:07,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 207 transitions, 563 flow [2025-03-17 10:59:07,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 207 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:07,423 INFO L231 Difference]: Finished difference. Result has 198 places, 203 transitions, 491 flow [2025-03-17 10:59:07,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=491, PETRI_PLACES=198, PETRI_TRANSITIONS=203} [2025-03-17 10:59:07,424 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -10 predicate places. [2025-03-17 10:59:07,424 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 203 transitions, 491 flow [2025-03-17 10:59:07,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 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 10:59:07,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:07,425 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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] [2025-03-17 10:59:07,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:59:07,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-17 10:59:07,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:07,426 INFO L85 PathProgramCache]: Analyzing trace with hash 668513722, now seen corresponding path program 1 times [2025-03-17 10:59:07,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:07,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246945882] [2025-03-17 10:59:07,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:07,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:07,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 10:59:07,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 10:59:07,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:07,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:59:07,440 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:59:07,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 10:59:07,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 10:59:07,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:07,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:59:07,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:59:07,455 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-03-17 10:59:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-03-17 10:59:07,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-03-17 10:59:07,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:59:07,456 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:07,457 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:59:07,457 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 10:59:07,501 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:59:07,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 285 transitions, 588 flow [2025-03-17 10:59:07,537 INFO L124 PetriNetUnfolderBase]: 17/313 cut-off events. [2025-03-17 10:59:07,538 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:59:07,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 313 events. 17/313 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 949 event pairs, 0 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 237. Up to 4 conditions per place. [2025-03-17 10:59:07,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 285 transitions, 588 flow [2025-03-17 10:59:07,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 285 transitions, 588 flow [2025-03-17 10:59:07,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:59:07,545 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;@3362110e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:59:07,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-17 10:59:07,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:59:07,547 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-17 10:59:07,547 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:59:07,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:07,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:07,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-17 10:59:07,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:07,548 INFO L85 PathProgramCache]: Analyzing trace with hash -607705665, now seen corresponding path program 1 times [2025-03-17 10:59:07,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:07,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717982211] [2025-03-17 10:59:07,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:07,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:07,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 10:59:07,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 10:59:07,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:07,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:07,565 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 10:59:07,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:07,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717982211] [2025-03-17 10:59:07,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717982211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:07,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:07,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:07,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687652078] [2025-03-17 10:59:07,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:07,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:07,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:07,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:07,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:07,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 285 [2025-03-17 10:59:07,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 285 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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 10:59:07,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:07,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 285 [2025-03-17 10:59:07,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:08,104 INFO L124 PetriNetUnfolderBase]: 829/4689 cut-off events. [2025-03-17 10:59:08,104 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-03-17 10:59:08,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5947 conditions, 4689 events. 829/4689 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 48237 event pairs, 630 based on Foata normal form. 685/4575 useless extension candidates. Maximal degree in co-relation 4862. Up to 1033 conditions per place. [2025-03-17 10:59:08,153 INFO L140 encePairwiseOnDemand]: 274/285 looper letters, 24 selfloop transitions, 2 changer transitions 1/266 dead transitions. [2025-03-17 10:59:08,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 266 transitions, 602 flow [2025-03-17 10:59:08,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2025-03-17 10:59:08,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.904093567251462 [2025-03-17 10:59:08,156 INFO L175 Difference]: Start difference. First operand has 275 places, 285 transitions, 588 flow. Second operand 3 states and 773 transitions. [2025-03-17 10:59:08,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 266 transitions, 602 flow [2025-03-17 10:59:08,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 600 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:08,159 INFO L231 Difference]: Finished difference. Result has 265 places, 265 transitions, 550 flow [2025-03-17 10:59:08,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=265, PETRI_TRANSITIONS=265} [2025-03-17 10:59:08,161 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -10 predicate places. [2025-03-17 10:59:08,161 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 265 transitions, 550 flow [2025-03-17 10:59:08,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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 10:59:08,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:08,162 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] [2025-03-17 10:59:08,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:59:08,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-17 10:59:08,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 483788542, now seen corresponding path program 1 times [2025-03-17 10:59:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304766623] [2025-03-17 10:59:08,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:08,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 10:59:08,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 10:59:08,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:08,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:08,181 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 10:59:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304766623] [2025-03-17 10:59:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304766623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:08,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:08,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:08,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530771609] [2025-03-17 10:59:08,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:08,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:08,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:08,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:08,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:08,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 285 [2025-03-17 10:59:08,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 265 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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 10:59:08,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:08,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 285 [2025-03-17 10:59:08,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:08,450 INFO L124 PetriNetUnfolderBase]: 335/2597 cut-off events. [2025-03-17 10:59:08,450 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-17 10:59:08,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 2597 events. 335/2597 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 23529 event pairs, 220 based on Foata normal form. 0/2136 useless extension candidates. Maximal degree in co-relation 3047. Up to 382 conditions per place. [2025-03-17 10:59:08,506 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 21 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-03-17 10:59:08,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 594 flow [2025-03-17 10:59:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2025-03-17 10:59:08,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017543859649123 [2025-03-17 10:59:08,508 INFO L175 Difference]: Start difference. First operand has 265 places, 265 transitions, 550 flow. Second operand 3 states and 771 transitions. [2025-03-17 10:59:08,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 594 flow [2025-03-17 10:59:08,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:08,512 INFO L231 Difference]: Finished difference. Result has 263 places, 264 transitions, 548 flow [2025-03-17 10:59:08,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=263, PETRI_TRANSITIONS=264} [2025-03-17 10:59:08,513 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -12 predicate places. [2025-03-17 10:59:08,513 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 264 transitions, 548 flow [2025-03-17 10:59:08,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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 10:59:08,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:08,513 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] [2025-03-17 10:59:08,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:59:08,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-17 10:59:08,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash 631284499, now seen corresponding path program 1 times [2025-03-17 10:59:08,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:08,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821684497] [2025-03-17 10:59:08,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:08,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:08,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 10:59:08,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 10:59:08,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:08,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:08,531 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 10:59:08,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:08,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821684497] [2025-03-17 10:59:08,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821684497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645643307] [2025-03-17 10:59:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:08,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:08,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:08,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:08,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 285 [2025-03-17 10:59:08,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 264 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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 10:59:08,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:08,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 285 [2025-03-17 10:59:08,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:09,146 INFO L124 PetriNetUnfolderBase]: 985/6367 cut-off events. [2025-03-17 10:59:09,147 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2025-03-17 10:59:09,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7666 conditions, 6367 events. 985/6367 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 69484 event pairs, 630 based on Foata normal form. 0/5355 useless extension candidates. Maximal degree in co-relation 7625. Up to 1120 conditions per place. [2025-03-17 10:59:09,188 INFO L140 encePairwiseOnDemand]: 275/285 looper letters, 27 selfloop transitions, 1 changer transitions 0/255 dead transitions. [2025-03-17 10:59:09,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 255 transitions, 586 flow [2025-03-17 10:59:09,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2025-03-17 10:59:09,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748538011695907 [2025-03-17 10:59:09,191 INFO L175 Difference]: Start difference. First operand has 263 places, 264 transitions, 548 flow. Second operand 3 states and 748 transitions. [2025-03-17 10:59:09,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 255 transitions, 586 flow [2025-03-17 10:59:09,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 255 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:09,193 INFO L231 Difference]: Finished difference. Result has 254 places, 255 transitions, 528 flow [2025-03-17 10:59:09,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=254, PETRI_TRANSITIONS=255} [2025-03-17 10:59:09,194 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -21 predicate places. [2025-03-17 10:59:09,194 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 255 transitions, 528 flow [2025-03-17 10:59:09,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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 10:59:09,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:09,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:09,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:59:09,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-17 10:59:09,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash 494890180, now seen corresponding path program 1 times [2025-03-17 10:59:09,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:09,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332955174] [2025-03-17 10:59:09,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:09,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:09,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:59:09,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:59:09,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:09,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:09,222 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 10:59:09,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:09,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332955174] [2025-03-17 10:59:09,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332955174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:09,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:09,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:09,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478508717] [2025-03-17 10:59:09,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:09,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:09,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:09,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:09,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 285 [2025-03-17 10:59:09,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 255 transitions, 528 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 10:59:09,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:09,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 285 [2025-03-17 10:59:09,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:09,373 INFO L124 PetriNetUnfolderBase]: 190/1767 cut-off events. [2025-03-17 10:59:09,374 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-17 10:59:09,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 1767 events. 190/1767 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 13809 event pairs, 108 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 1992. Up to 196 conditions per place. [2025-03-17 10:59:09,392 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 15 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-03-17 10:59:09,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 560 flow [2025-03-17 10:59:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2025-03-17 10:59:09,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2025-03-17 10:59:09,395 INFO L175 Difference]: Start difference. First operand has 254 places, 255 transitions, 528 flow. Second operand 3 states and 783 transitions. [2025-03-17 10:59:09,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 560 flow [2025-03-17 10:59:09,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 254 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:59:09,398 INFO L231 Difference]: Finished difference. Result has 254 places, 254 transitions, 529 flow [2025-03-17 10:59:09,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=254, PETRI_TRANSITIONS=254} [2025-03-17 10:59:09,399 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -21 predicate places. [2025-03-17 10:59:09,399 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 254 transitions, 529 flow [2025-03-17 10:59:09,400 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 10:59:09,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:09,400 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] [2025-03-17 10:59:09,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:59:09,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-17 10:59:09,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:09,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1776780023, now seen corresponding path program 1 times [2025-03-17 10:59:09,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:09,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309641721] [2025-03-17 10:59:09,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:09,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:09,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:59:09,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:59:09,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:09,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:09,436 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 10:59:09,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:09,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309641721] [2025-03-17 10:59:09,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309641721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:09,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:09,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:09,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792030733] [2025-03-17 10:59:09,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:09,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:09,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:09,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:09,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:09,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 285 [2025-03-17 10:59:09,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 254 transitions, 529 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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 10:59:09,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:09,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 285 [2025-03-17 10:59:09,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:11,363 INFO L124 PetriNetUnfolderBase]: 4660/23982 cut-off events. [2025-03-17 10:59:11,363 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-03-17 10:59:11,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30441 conditions, 23982 events. 4660/23982 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 330878 event pairs, 1667 based on Foata normal form. 0/20559 useless extension candidates. Maximal degree in co-relation 30400. Up to 4132 conditions per place. [2025-03-17 10:59:11,517 INFO L140 encePairwiseOnDemand]: 255/285 looper letters, 48 selfloop transitions, 21 changer transitions 0/283 dead transitions. [2025-03-17 10:59:11,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 283 transitions, 735 flow [2025-03-17 10:59:11,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2025-03-17 10:59:11,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2025-03-17 10:59:11,520 INFO L175 Difference]: Start difference. First operand has 254 places, 254 transitions, 529 flow. Second operand 3 states and 780 transitions. [2025-03-17 10:59:11,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 283 transitions, 735 flow [2025-03-17 10:59:11,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 283 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:11,523 INFO L231 Difference]: Finished difference. Result has 256 places, 275 transitions, 711 flow [2025-03-17 10:59:11,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=256, PETRI_TRANSITIONS=275} [2025-03-17 10:59:11,524 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -19 predicate places. [2025-03-17 10:59:11,524 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 275 transitions, 711 flow [2025-03-17 10:59:11,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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 10:59:11,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:11,525 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:59:11,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:59:11,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-17 10:59:11,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1223637989, now seen corresponding path program 1 times [2025-03-17 10:59:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645539102] [2025-03-17 10:59:11,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:11,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 10:59:11,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 10:59:11,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:11,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:11,580 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 10:59:11,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:11,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645539102] [2025-03-17 10:59:11,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645539102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:11,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:11,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:11,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657022904] [2025-03-17 10:59:11,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:11,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:59:11,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:11,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:59:11,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:59:11,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 285 [2025-03-17 10:59:11,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 275 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 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 10:59:11,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:11,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 285 [2025-03-17 10:59:11,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:12,190 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([812] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [170#L1045true, Black: 292#(= |#race~next~0| 0), 122#L1045true, 286#(= |#race~len~0| 0), 276#true, 274#true, 117#L1060-1true, 290#true, 239#thrENTRYtrue, 272#true, 295#true]) [2025-03-17 10:59:12,190 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-03-17 10:59:12,190 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-17 10:59:12,190 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-17 10:59:12,191 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-17 10:59:12,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([812] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [170#L1045true, Black: 292#(= |#race~next~0| 0), 122#L1045true, 286#(= |#race~len~0| 0), 276#true, 274#true, 117#L1060-1true, 290#true, 272#true, 295#true, 258#L1040true]) [2025-03-17 10:59:12,456 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-17 10:59:12,456 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-17 10:59:12,456 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-17 10:59:12,456 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-17 10:59:12,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][160], [170#L1045true, Black: 290#true, 292#(= |#race~next~0| 0), 221#L1043true, 286#(= |#race~len~0| 0), 276#true, 274#true, 117#L1060-1true, 272#true, 68#L1045true, 295#true]) [2025-03-17 10:59:12,755 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2025-03-17 10:59:12,755 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-17 10:59:12,755 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-17 10:59:12,755 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-03-17 10:59:12,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([950] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [170#L1045true, Black: 292#(= |#race~next~0| 0), 122#L1045true, 276#true, 274#true, 286#(= |#race~len~0| 0), 117#L1060-1true, 290#true, 68#L1045true, 272#true, 295#true]) [2025-03-17 10:59:12,789 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-03-17 10:59:12,790 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-17 10:59:12,790 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-17 10:59:12,790 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-17 10:59:13,226 INFO L124 PetriNetUnfolderBase]: 2516/17384 cut-off events. [2025-03-17 10:59:13,226 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2025-03-17 10:59:13,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21905 conditions, 17384 events. 2516/17384 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 237607 event pairs, 1056 based on Foata normal form. 1/15063 useless extension candidates. Maximal degree in co-relation 21863. Up to 2203 conditions per place. [2025-03-17 10:59:13,432 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 20 selfloop transitions, 0 changer transitions 4/278 dead transitions. [2025-03-17 10:59:13,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 278 transitions, 765 flow [2025-03-17 10:59:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:59:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 10:59:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1280 transitions. [2025-03-17 10:59:13,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982456140350877 [2025-03-17 10:59:13,435 INFO L175 Difference]: Start difference. First operand has 256 places, 275 transitions, 711 flow. Second operand 5 states and 1280 transitions. [2025-03-17 10:59:13,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 278 transitions, 765 flow [2025-03-17 10:59:13,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 278 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:13,460 INFO L231 Difference]: Finished difference. Result has 261 places, 274 transitions, 673 flow [2025-03-17 10:59:13,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=673, PETRI_PLACES=261, PETRI_TRANSITIONS=274} [2025-03-17 10:59:13,461 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -14 predicate places. [2025-03-17 10:59:13,461 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 274 transitions, 673 flow [2025-03-17 10:59:13,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 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 10:59:13,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:13,462 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:59:13,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 10:59:13,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-17 10:59:13,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2036599647, now seen corresponding path program 1 times [2025-03-17 10:59:13,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:13,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886909987] [2025-03-17 10:59:13,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:13,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 10:59:13,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:59:13,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:13,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:59:13,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:59:13,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 10:59:13,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:59:13,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:13,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:59:13,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:59:13,504 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:59:13,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2025-03-17 10:59:13,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2025-03-17 10:59:13,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2025-03-17 10:59:13,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2025-03-17 10:59:13,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2025-03-17 10:59:13,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2025-03-17 10:59:13,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2025-03-17 10:59:13,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (28 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2025-03-17 10:59:13,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2025-03-17 10:59:13,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2025-03-17 10:59:13,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2025-03-17 10:59:13,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2025-03-17 10:59:13,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 39 remaining) [2025-03-17 10:59:13,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 10:59:13,508 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:13,509 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:59:13,509 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 10:59:13,554 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:59:13,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 342 places, 355 transitions, 738 flow [2025-03-17 10:59:13,622 INFO L124 PetriNetUnfolderBase]: 22/393 cut-off events. [2025-03-17 10:59:13,622 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 10:59:13,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 393 events. 22/393 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1435 event pairs, 0 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 321. Up to 5 conditions per place. [2025-03-17 10:59:13,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 342 places, 355 transitions, 738 flow [2025-03-17 10:59:13,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 355 transitions, 738 flow [2025-03-17 10:59:13,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:59:13,629 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;@3362110e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:59:13,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-03-17 10:59:13,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:59:13,631 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-17 10:59:13,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:59:13,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:13,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:13,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 10:59:13,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:13,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1462692610, now seen corresponding path program 1 times [2025-03-17 10:59:13,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:13,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967945951] [2025-03-17 10:59:13,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:13,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:13,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 10:59:13,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 10:59:13,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:13,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:59:13,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:13,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967945951] [2025-03-17 10:59:13,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967945951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:13,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:13,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255069688] [2025-03-17 10:59:13,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:13,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:13,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:13,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:13,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:13,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 355 [2025-03-17 10:59:13,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 355 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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 10:59:13,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:13,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 355 [2025-03-17 10:59:13,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:17,317 INFO L124 PetriNetUnfolderBase]: 8203/34874 cut-off events. [2025-03-17 10:59:17,317 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2025-03-17 10:59:17,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46423 conditions, 34874 events. 8203/34874 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 484838 event pairs, 6804 based on Foata normal form. 5566/34841 useless extension candidates. Maximal degree in co-relation 38089. Up to 9608 conditions per place. [2025-03-17 10:59:17,746 INFO L140 encePairwiseOnDemand]: 342/355 looper letters, 31 selfloop transitions, 2 changer transitions 1/332 dead transitions. [2025-03-17 10:59:17,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 332 transitions, 758 flow [2025-03-17 10:59:17,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-17 10:59:17,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032863849765258 [2025-03-17 10:59:17,748 INFO L175 Difference]: Start difference. First operand has 342 places, 355 transitions, 738 flow. Second operand 3 states and 962 transitions. [2025-03-17 10:59:17,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 332 transitions, 758 flow [2025-03-17 10:59:17,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 332 transitions, 752 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:17,752 INFO L231 Difference]: Finished difference. Result has 330 places, 331 transitions, 688 flow [2025-03-17 10:59:17,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=330, PETRI_TRANSITIONS=331} [2025-03-17 10:59:17,753 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -12 predicate places. [2025-03-17 10:59:17,753 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 331 transitions, 688 flow [2025-03-17 10:59:17,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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 10:59:17,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:17,753 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] [2025-03-17 10:59:17,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 10:59:17,754 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 10:59:17,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:17,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1807529826, now seen corresponding path program 1 times [2025-03-17 10:59:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:17,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689481476] [2025-03-17 10:59:17,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:17,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 10:59:17,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 10:59:17,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:17,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:17,768 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 10:59:17,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:17,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689481476] [2025-03-17 10:59:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689481476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:17,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:17,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:17,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950743274] [2025-03-17 10:59:17,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:17,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:17,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:17,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:17,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:17,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 355 [2025-03-17 10:59:17,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 331 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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 10:59:17,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:17,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 355 [2025-03-17 10:59:17,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:19,326 INFO L124 PetriNetUnfolderBase]: 2303/13468 cut-off events. [2025-03-17 10:59:19,326 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-03-17 10:59:19,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16452 conditions, 13468 events. 2303/13468 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 168782 event pairs, 1720 based on Foata normal form. 0/11135 useless extension candidates. Maximal degree in co-relation 16418. Up to 2507 conditions per place. [2025-03-17 10:59:19,498 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 26 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2025-03-17 10:59:19,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 330 transitions, 742 flow [2025-03-17 10:59:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-17 10:59:19,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032863849765258 [2025-03-17 10:59:19,501 INFO L175 Difference]: Start difference. First operand has 330 places, 331 transitions, 688 flow. Second operand 3 states and 962 transitions. [2025-03-17 10:59:19,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 330 transitions, 742 flow [2025-03-17 10:59:19,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 330 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:19,505 INFO L231 Difference]: Finished difference. Result has 328 places, 330 transitions, 686 flow [2025-03-17 10:59:19,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=328, PETRI_TRANSITIONS=330} [2025-03-17 10:59:19,506 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -14 predicate places. [2025-03-17 10:59:19,506 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 330 transitions, 686 flow [2025-03-17 10:59:19,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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 10:59:19,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:19,506 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] [2025-03-17 10:59:19,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 10:59:19,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 10:59:19,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:19,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1141189261, now seen corresponding path program 1 times [2025-03-17 10:59:19,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:19,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466059334] [2025-03-17 10:59:19,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:19,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:19,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 10:59:19,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 10:59:19,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:19,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:19,523 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 10:59:19,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:19,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466059334] [2025-03-17 10:59:19,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466059334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:19,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:19,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:19,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829370817] [2025-03-17 10:59:19,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:19,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:19,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:19,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:19,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:19,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 355 [2025-03-17 10:59:19,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 330 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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 10:59:19,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:19,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 355 [2025-03-17 10:59:19,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:25,223 INFO L124 PetriNetUnfolderBase]: 9761/49199 cut-off events. [2025-03-17 10:59:25,224 INFO L125 PetriNetUnfolderBase]: For 1205/1205 co-relation queries the response was YES. [2025-03-17 10:59:25,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61006 conditions, 49199 events. 9761/49199 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 737677 event pairs, 6804 based on Foata normal form. 0/41396 useless extension candidates. Maximal degree in co-relation 60964. Up to 10598 conditions per place. [2025-03-17 10:59:25,891 INFO L140 encePairwiseOnDemand]: 343/355 looper letters, 34 selfloop transitions, 1 changer transitions 0/319 dead transitions. [2025-03-17 10:59:25,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 319 transitions, 734 flow [2025-03-17 10:59:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 931 transitions. [2025-03-17 10:59:25,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8741784037558685 [2025-03-17 10:59:25,894 INFO L175 Difference]: Start difference. First operand has 328 places, 330 transitions, 686 flow. Second operand 3 states and 931 transitions. [2025-03-17 10:59:25,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 319 transitions, 734 flow [2025-03-17 10:59:25,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 319 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:25,898 INFO L231 Difference]: Finished difference. Result has 317 places, 319 transitions, 662 flow [2025-03-17 10:59:25,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=317, PETRI_TRANSITIONS=319} [2025-03-17 10:59:25,899 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -25 predicate places. [2025-03-17 10:59:25,899 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 319 transitions, 662 flow [2025-03-17 10:59:25,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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 10:59:25,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:25,900 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] [2025-03-17 10:59:25,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 10:59:25,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 10:59:25,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash -412245468, now seen corresponding path program 1 times [2025-03-17 10:59:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:25,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454435917] [2025-03-17 10:59:25,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:25,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:25,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:59:25,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:59:25,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:25,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:25,922 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 10:59:25,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454435917] [2025-03-17 10:59:25,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454435917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:25,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:25,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:25,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986774512] [2025-03-17 10:59:25,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:25,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:25,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:25,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:25,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:25,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 355 [2025-03-17 10:59:25,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 319 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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 10:59:25,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:25,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 355 [2025-03-17 10:59:25,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:26,604 INFO L124 PetriNetUnfolderBase]: 1021/7284 cut-off events. [2025-03-17 10:59:26,605 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-03-17 10:59:26,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8575 conditions, 7284 events. 1021/7284 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 80315 event pairs, 684 based on Foata normal form. 0/6099 useless extension candidates. Maximal degree in co-relation 8533. Up to 1028 conditions per place. [2025-03-17 10:59:26,717 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 19 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-03-17 10:59:26,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 318 transitions, 702 flow [2025-03-17 10:59:26,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2025-03-17 10:59:26,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9164319248826291 [2025-03-17 10:59:26,719 INFO L175 Difference]: Start difference. First operand has 317 places, 319 transitions, 662 flow. Second operand 3 states and 976 transitions. [2025-03-17 10:59:26,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 318 transitions, 702 flow [2025-03-17 10:59:26,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:59:26,723 INFO L231 Difference]: Finished difference. Result has 317 places, 318 transitions, 663 flow [2025-03-17 10:59:26,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=663, PETRI_PLACES=317, PETRI_TRANSITIONS=318} [2025-03-17 10:59:26,724 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -25 predicate places. [2025-03-17 10:59:26,724 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 318 transitions, 663 flow [2025-03-17 10:59:26,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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 10:59:26,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:26,724 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] [2025-03-17 10:59:26,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 10:59:26,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 10:59:26,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:26,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2129236025, now seen corresponding path program 1 times [2025-03-17 10:59:26,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:26,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155345625] [2025-03-17 10:59:26,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:26,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:26,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:59:26,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:59:26,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:26,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:26,751 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 10:59:26,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:26,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155345625] [2025-03-17 10:59:26,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155345625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:26,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:26,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:26,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631882211] [2025-03-17 10:59:26,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:26,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:26,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:26,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:26,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 355 [2025-03-17 10:59:26,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 318 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 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 10:59:26,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:26,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 355 [2025-03-17 10:59:26,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand