./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.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 e281184c6e6629633efbcea3a2283a3a54dcfd040e15fa389b71c86937ccbf2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:50:01,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:50:01,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:50:01,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:50:01,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:50:01,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:50:01,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:50:01,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:50:01,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:50:01,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:50:01,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:50:01,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:50:01,522 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:50:01,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:50:01,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:50:01,524 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:50:01,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:50:01,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:50:01,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:50:01,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:50:01,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:50:01,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:50:01,524 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:50:01,524 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:50:01,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:50:01,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:50:01,525 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:50:01,525 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:50:01,525 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:50:01,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:50:01,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:50:01,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:50:01,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:50:01,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:50:01,526 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:50:01,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:50:01,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:50:01,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:50:01,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:50:01,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:50:01,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:50:01,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:50:01,526 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 -> e281184c6e6629633efbcea3a2283a3a54dcfd040e15fa389b71c86937ccbf2b [2025-03-14 01:50:01,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:50:01,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:50:01,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:50:01,762 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:50:01,763 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:50:01,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i [2025-03-14 01:50:02,850 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e14d5f7/98530602eece42cd9cd17ee4e50884e4/FLAGfbcfcd1d4 [2025-03-14 01:50:03,119 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:50:03,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i [2025-03-14 01:50:03,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e14d5f7/98530602eece42cd9cd17ee4e50884e4/FLAGfbcfcd1d4 [2025-03-14 01:50:03,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e14d5f7/98530602eece42cd9cd17ee4e50884e4 [2025-03-14 01:50:03,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:50:03,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:50:03,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:50:03,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:50:03,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:50:03,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbdc84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03, skipping insertion in model container [2025-03-14 01:50:03,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:50:03,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:50:03,708 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:50:03,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:50:03,769 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:50:03,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03 WrapperNode [2025-03-14 01:50:03,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:50:03,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:50:03,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:50:03,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:50:03,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,796 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2025-03-14 01:50:03,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:50:03,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:50:03,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:50:03,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:50:03,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:50:03,815 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:50:03,815 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:50:03,815 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:50:03,816 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (1/1) ... [2025-03-14 01:50:03,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:50:03,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:50:03,842 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-14 01:50:03,844 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-14 01:50:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:50:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:50:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:50:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:50:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:50:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:50:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:50:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:50:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-14 01:50:03,858 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-14 01:50:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:50:03,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:50:03,859 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:50:03,949 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:50:03,950 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:50:04,113 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:50:04,113 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:50:04,113 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:50:04,125 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:50:04,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:50:04 BoogieIcfgContainer [2025-03-14 01:50:04,126 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:50:04,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:50:04,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:50:04,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:50:04,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:50:03" (1/3) ... [2025-03-14 01:50:04,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2ad39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:50:04, skipping insertion in model container [2025-03-14 01:50:04,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:50:03" (2/3) ... [2025-03-14 01:50:04,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2ad39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:50:04, skipping insertion in model container [2025-03-14 01:50:04,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:50:04" (3/3) ... [2025-03-14 01:50:04,134 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic.i [2025-03-14 01:50:04,143 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:50:04,144 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-dynamic.i that has 2 procedures, 87 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-14 01:50:04,144 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:50:04,182 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:50:04,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 185 flow [2025-03-14 01:50:04,253 INFO L124 PetriNetUnfolderBase]: 2/121 cut-off events. [2025-03-14 01:50:04,256 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:50:04,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 121 events. 2/121 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 60. Up to 3 conditions per place. [2025-03-14 01:50:04,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 89 transitions, 185 flow [2025-03-14 01:50:04,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 89 transitions, 185 flow [2025-03-14 01:50:04,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:50:04,274 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;@1254ff24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:50:04,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 01:50:04,287 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:50:04,289 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-14 01:50:04,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:50:04,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:04,290 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-14 01:50:04,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-14 01:50:04,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash 579840394, now seen corresponding path program 1 times [2025-03-14 01:50:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:04,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998765053] [2025-03-14 01:50:04,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:04,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:50:04,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:50:04,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:04,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:04,473 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-14 01:50:04,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998765053] [2025-03-14 01:50:04,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998765053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:04,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:04,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:04,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740584555] [2025-03-14 01:50:04,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:04,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:04,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:04,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:04,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 89 [2025-03-14 01:50:04,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:04,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:04,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 89 [2025-03-14 01:50:04,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:04,564 INFO L124 PetriNetUnfolderBase]: 8/163 cut-off events. [2025-03-14 01:50:04,567 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-14 01:50:04,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 163 events. 8/163 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 409 event pairs, 1 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2025-03-14 01:50:04,569 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 8 selfloop transitions, 3 changer transitions 2/92 dead transitions. [2025-03-14 01:50:04,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 215 flow [2025-03-14 01:50:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-03-14 01:50:04,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951310861423221 [2025-03-14 01:50:04,582 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 185 flow. Second operand 3 states and 254 transitions. [2025-03-14 01:50:04,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 215 flow [2025-03-14 01:50:04,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:50:04,591 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 203 flow [2025-03-14 01:50:04,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2025-03-14 01:50:04,596 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-03-14 01:50:04,596 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 203 flow [2025-03-14 01:50:04,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:04,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:04,597 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] [2025-03-14 01:50:04,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:50:04,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-14 01:50:04,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash 769112976, now seen corresponding path program 1 times [2025-03-14 01:50:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:04,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158317345] [2025-03-14 01:50:04,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:04,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:04,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:50:04,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:50:04,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:04,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:05,030 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-14 01:50:05,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:05,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158317345] [2025-03-14 01:50:05,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158317345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:05,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:05,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:05,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635669582] [2025-03-14 01:50:05,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:05,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:05,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:05,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:05,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:05,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2025-03-14 01:50:05,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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-14 01:50:05,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:05,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2025-03-14 01:50:05,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:05,234 INFO L124 PetriNetUnfolderBase]: 31/264 cut-off events. [2025-03-14 01:50:05,234 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-14 01:50:05,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 264 events. 31/264 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1171 event pairs, 11 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 299. Up to 62 conditions per place. [2025-03-14 01:50:05,236 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 24 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2025-03-14 01:50:05,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 275 flow [2025-03-14 01:50:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 426 transitions. [2025-03-14 01:50:05,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.797752808988764 [2025-03-14 01:50:05,239 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 203 flow. Second operand 6 states and 426 transitions. [2025-03-14 01:50:05,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 275 flow [2025-03-14 01:50:05,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:05,243 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 205 flow [2025-03-14 01:50:05,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2025-03-14 01:50:05,244 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-03-14 01:50:05,244 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 205 flow [2025-03-14 01:50:05,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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-14 01:50:05,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:05,244 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] [2025-03-14 01:50:05,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:50:05,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-14 01:50:05,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:05,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1703433976, now seen corresponding path program 1 times [2025-03-14 01:50:05,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:05,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422032871] [2025-03-14 01:50:05,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:05,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:05,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:50:05,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:50:05,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:05,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:05,328 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-14 01:50:05,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:05,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422032871] [2025-03-14 01:50:05,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422032871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:05,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:05,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:05,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406956910] [2025-03-14 01:50:05,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:05,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:50:05,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:05,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:50:05,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:50:05,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 89 [2025-03-14 01:50:05,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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-14 01:50:05,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:05,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 89 [2025-03-14 01:50:05,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:05,453 INFO L124 PetriNetUnfolderBase]: 17/232 cut-off events. [2025-03-14 01:50:05,453 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:50:05,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 232 events. 17/232 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 813 event pairs, 1 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2025-03-14 01:50:05,455 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 15 selfloop transitions, 2 changer transitions 5/95 dead transitions. [2025-03-14 01:50:05,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 263 flow [2025-03-14 01:50:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 461 transitions. [2025-03-14 01:50:05,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8632958801498127 [2025-03-14 01:50:05,458 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 205 flow. Second operand 6 states and 461 transitions. [2025-03-14 01:50:05,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 263 flow [2025-03-14 01:50:05,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 253 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:50:05,462 INFO L231 Difference]: Finished difference. Result has 99 places, 88 transitions, 213 flow [2025-03-14 01:50:05,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=88} [2025-03-14 01:50:05,463 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2025-03-14 01:50:05,463 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 88 transitions, 213 flow [2025-03-14 01:50:05,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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-14 01:50:05,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:05,464 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] [2025-03-14 01:50:05,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:50:05,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-14 01:50:05,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1742150653, now seen corresponding path program 1 times [2025-03-14 01:50:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:05,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434916514] [2025-03-14 01:50:05,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:05,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:50:05,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:50:05,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:05,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:05,501 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-14 01:50:05,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:05,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434916514] [2025-03-14 01:50:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434916514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:05,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314042769] [2025-03-14 01:50:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:05,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:05,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:05,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:05,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 89 [2025-03-14 01:50:05,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-14 01:50:05,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:05,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 89 [2025-03-14 01:50:05,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:05,537 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2025-03-14 01:50:05,538 INFO L125 PetriNetUnfolderBase]: For 13/25 co-relation queries the response was YES. [2025-03-14 01:50:05,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 169 events. 5/169 cut-off events. For 13/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 482 event pairs, 3 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 189. Up to 25 conditions per place. [2025-03-14 01:50:05,538 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 8 selfloop transitions, 4 changer transitions 3/91 dead transitions. [2025-03-14 01:50:05,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 249 flow [2025-03-14 01:50:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-03-14 01:50:05,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288389513108615 [2025-03-14 01:50:05,539 INFO L175 Difference]: Start difference. First operand has 99 places, 88 transitions, 213 flow. Second operand 3 states and 248 transitions. [2025-03-14 01:50:05,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 249 flow [2025-03-14 01:50:05,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 235 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-14 01:50:05,542 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 221 flow [2025-03-14 01:50:05,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2025-03-14 01:50:05,542 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-03-14 01:50:05,542 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 221 flow [2025-03-14 01:50:05,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-14 01:50:05,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:05,543 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] [2025-03-14 01:50:05,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:50:05,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-14 01:50:05,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1668930352, now seen corresponding path program 1 times [2025-03-14 01:50:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138403331] [2025-03-14 01:50:05,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:05,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-14 01:50:05,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:50:05,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:05,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:05,800 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-14 01:50:05,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:05,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138403331] [2025-03-14 01:50:05,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138403331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:05,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:05,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:05,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346559314] [2025-03-14 01:50:05,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:05,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:05,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:05,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:05,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:05,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 89 [2025-03-14 01:50:05,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 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-14 01:50:05,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:05,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 89 [2025-03-14 01:50:05,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:05,941 INFO L124 PetriNetUnfolderBase]: 25/282 cut-off events. [2025-03-14 01:50:05,942 INFO L125 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2025-03-14 01:50:05,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 282 events. 25/282 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1219 event pairs, 15 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2025-03-14 01:50:05,943 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 12 selfloop transitions, 0 changer transitions 20/95 dead transitions. [2025-03-14 01:50:05,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 289 flow [2025-03-14 01:50:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 436 transitions. [2025-03-14 01:50:05,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8164794007490637 [2025-03-14 01:50:05,944 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 221 flow. Second operand 6 states and 436 transitions. [2025-03-14 01:50:05,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 289 flow [2025-03-14 01:50:05,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:05,946 INFO L231 Difference]: Finished difference. Result has 97 places, 75 transitions, 184 flow [2025-03-14 01:50:05,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2025-03-14 01:50:05,947 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2025-03-14 01:50:05,947 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 184 flow [2025-03-14 01:50:05,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 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-14 01:50:05,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:05,947 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:05,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:50:05,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-14 01:50:05,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash -463222286, now seen corresponding path program 1 times [2025-03-14 01:50:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:05,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738300020] [2025-03-14 01:50:05,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:05,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:50:05,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:50:05,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:05,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:05,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:50:05,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:50:05,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:50:05,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:05,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:05,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:50:05,996 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:50:05,997 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-14 01:50:05,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-03-14 01:50:05,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-03-14 01:50:05,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-03-14 01:50:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-03-14 01:50:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-03-14 01:50:05,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:50:05,999 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-14 01:50:06,000 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:50:06,001 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:50:06,015 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:50:06,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 107 transitions, 230 flow [2025-03-14 01:50:06,049 INFO L124 PetriNetUnfolderBase]: 4/205 cut-off events. [2025-03-14 01:50:06,049 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:50:06,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 205 events. 4/205 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 446 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 123. Up to 6 conditions per place. [2025-03-14 01:50:06,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 107 transitions, 230 flow [2025-03-14 01:50:06,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 107 transitions, 230 flow [2025-03-14 01:50:06,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:50:06,051 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;@1254ff24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:50:06,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 01:50:06,053 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:50:06,054 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-14 01:50:06,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:50:06,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:06,055 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-14 01:50:06,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-14 01:50:06,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1436929258, now seen corresponding path program 1 times [2025-03-14 01:50:06,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:06,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747062980] [2025-03-14 01:50:06,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:06,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:50:06,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:50:06,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:06,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:06,077 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-14 01:50:06,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:06,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747062980] [2025-03-14 01:50:06,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747062980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:06,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:06,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:06,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317972761] [2025-03-14 01:50:06,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:06,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:06,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:06,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:06,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:06,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2025-03-14 01:50:06,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-14 01:50:06,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:06,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2025-03-14 01:50:06,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:06,176 INFO L124 PetriNetUnfolderBase]: 119/731 cut-off events. [2025-03-14 01:50:06,176 INFO L125 PetriNetUnfolderBase]: For 44/68 co-relation queries the response was YES. [2025-03-14 01:50:06,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 731 events. 119/731 cut-off events. For 44/68 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4288 event pairs, 50 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 749. Up to 139 conditions per place. [2025-03-14 01:50:06,183 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 16 selfloop transitions, 4 changer transitions 1/113 dead transitions. [2025-03-14 01:50:06,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 113 transitions, 282 flow [2025-03-14 01:50:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:06,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2025-03-14 01:50:06,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376947040498442 [2025-03-14 01:50:06,185 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 230 flow. Second operand 3 states and 301 transitions. [2025-03-14 01:50:06,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 113 transitions, 282 flow [2025-03-14 01:50:06,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:50:06,187 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 256 flow [2025-03-14 01:50:06,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2025-03-14 01:50:06,189 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places. [2025-03-14 01:50:06,190 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 256 flow [2025-03-14 01:50:06,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-14 01:50:06,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:06,191 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] [2025-03-14 01:50:06,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:50:06,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-14 01:50:06,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:06,191 INFO L85 PathProgramCache]: Analyzing trace with hash -202206128, now seen corresponding path program 1 times [2025-03-14 01:50:06,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:06,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543791830] [2025-03-14 01:50:06,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:06,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:06,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:50:06,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:50:06,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:06,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:06,404 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-14 01:50:06,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:06,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543791830] [2025-03-14 01:50:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543791830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:06,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:06,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128765090] [2025-03-14 01:50:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:06,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:06,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:06,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:06,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2025-03-14 01:50:06,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 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-14 01:50:06,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:06,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2025-03-14 01:50:06,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:06,673 INFO L124 PetriNetUnfolderBase]: 299/1296 cut-off events. [2025-03-14 01:50:06,673 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-14 01:50:06,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 1296 events. 299/1296 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9678 event pairs, 58 based on Foata normal form. 0/1172 useless extension candidates. Maximal degree in co-relation 1396. Up to 372 conditions per place. [2025-03-14 01:50:06,702 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 36 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-14 01:50:06,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 123 transitions, 368 flow [2025-03-14 01:50:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2025-03-14 01:50:06,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8130841121495327 [2025-03-14 01:50:06,703 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 256 flow. Second operand 6 states and 522 transitions. [2025-03-14 01:50:06,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 123 transitions, 368 flow [2025-03-14 01:50:06,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 123 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:06,707 INFO L231 Difference]: Finished difference. Result has 114 places, 107 transitions, 256 flow [2025-03-14 01:50:06,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=114, PETRI_TRANSITIONS=107} [2025-03-14 01:50:06,709 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 5 predicate places. [2025-03-14 01:50:06,709 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 107 transitions, 256 flow [2025-03-14 01:50:06,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 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-14 01:50:06,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:06,710 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] [2025-03-14 01:50:06,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:50:06,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-14 01:50:06,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:06,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1620214216, now seen corresponding path program 1 times [2025-03-14 01:50:06,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:06,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904716495] [2025-03-14 01:50:06,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:06,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:06,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:50:06,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:50:06,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:06,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:06,761 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-14 01:50:06,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:06,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904716495] [2025-03-14 01:50:06,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904716495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:06,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:06,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099614483] [2025-03-14 01:50:06,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:06,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:50:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:06,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:50:06,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:50:06,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 107 [2025-03-14 01:50:06,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 107 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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-14 01:50:06,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:06,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 107 [2025-03-14 01:50:06,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:06,958 INFO L124 PetriNetUnfolderBase]: 189/1190 cut-off events. [2025-03-14 01:50:06,959 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-14 01:50:06,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1190 events. 189/1190 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8555 event pairs, 131 based on Foata normal form. 1/1090 useless extension candidates. Maximal degree in co-relation 1005. Up to 314 conditions per place. [2025-03-14 01:50:06,967 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 20 selfloop transitions, 2 changer transitions 5/115 dead transitions. [2025-03-14 01:50:06,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 326 flow [2025-03-14 01:50:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2025-03-14 01:50:06,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8566978193146417 [2025-03-14 01:50:06,970 INFO L175 Difference]: Start difference. First operand has 114 places, 107 transitions, 256 flow. Second operand 6 states and 550 transitions. [2025-03-14 01:50:06,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 326 flow [2025-03-14 01:50:06,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 316 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:50:06,973 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 268 flow [2025-03-14 01:50:06,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2025-03-14 01:50:06,974 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 9 predicate places. [2025-03-14 01:50:06,974 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 268 flow [2025-03-14 01:50:06,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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-14 01:50:06,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:06,976 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] [2025-03-14 01:50:06,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:50:06,976 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-14 01:50:06,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1141158291, now seen corresponding path program 1 times [2025-03-14 01:50:06,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:06,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883564904] [2025-03-14 01:50:06,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:06,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:06,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:50:06,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:50:06,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:06,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:07,007 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-14 01:50:07,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:07,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883564904] [2025-03-14 01:50:07,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883564904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:07,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:07,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:07,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762032659] [2025-03-14 01:50:07,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:07,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:07,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:07,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:07,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2025-03-14 01:50:07,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-14 01:50:07,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:07,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2025-03-14 01:50:07,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:07,105 INFO L124 PetriNetUnfolderBase]: 170/1036 cut-off events. [2025-03-14 01:50:07,106 INFO L125 PetriNetUnfolderBase]: For 197/324 co-relation queries the response was YES. [2025-03-14 01:50:07,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 1036 events. 170/1036 cut-off events. For 197/324 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7399 event pairs, 74 based on Foata normal form. 4/912 useless extension candidates. Maximal degree in co-relation 1591. Up to 268 conditions per place. [2025-03-14 01:50:07,111 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2025-03-14 01:50:07,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 117 transitions, 352 flow [2025-03-14 01:50:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2025-03-14 01:50:07,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252336448598131 [2025-03-14 01:50:07,113 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 268 flow. Second operand 3 states and 297 transitions. [2025-03-14 01:50:07,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 117 transitions, 352 flow [2025-03-14 01:50:07,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 340 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 01:50:07,116 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 312 flow [2025-03-14 01:50:07,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2025-03-14 01:50:07,117 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 6 predicate places. [2025-03-14 01:50:07,117 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 312 flow [2025-03-14 01:50:07,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-14 01:50:07,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:07,117 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] [2025-03-14 01:50:07,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:50:07,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-14 01:50:07,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:07,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1404964843, now seen corresponding path program 1 times [2025-03-14 01:50:07,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:07,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912641447] [2025-03-14 01:50:07,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:07,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:07,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-14 01:50:07,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:50:07,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:07,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:50:07,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:07,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912641447] [2025-03-14 01:50:07,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912641447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:07,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144003305] [2025-03-14 01:50:07,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:07,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:07,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:07,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:07,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:07,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2025-03-14 01:50:07,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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-14 01:50:07,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:07,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2025-03-14 01:50:07,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:07,588 INFO L124 PetriNetUnfolderBase]: 358/1837 cut-off events. [2025-03-14 01:50:07,589 INFO L125 PetriNetUnfolderBase]: For 314/362 co-relation queries the response was YES. [2025-03-14 01:50:07,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 1837 events. 358/1837 cut-off events. For 314/362 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 15501 event pairs, 179 based on Foata normal form. 4/1681 useless extension candidates. Maximal degree in co-relation 2430. Up to 362 conditions per place. [2025-03-14 01:50:07,598 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 34 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-03-14 01:50:07,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 128 transitions, 420 flow [2025-03-14 01:50:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions. [2025-03-14 01:50:07,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8286604361370716 [2025-03-14 01:50:07,600 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 312 flow. Second operand 6 states and 532 transitions. [2025-03-14 01:50:07,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 128 transitions, 420 flow [2025-03-14 01:50:07,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 128 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:07,603 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 306 flow [2025-03-14 01:50:07,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2025-03-14 01:50:07,605 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2025-03-14 01:50:07,605 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 306 flow [2025-03-14 01:50:07,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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-14 01:50:07,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:07,606 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] [2025-03-14 01:50:07,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:50:07,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-14 01:50:07,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash -953658766, now seen corresponding path program 1 times [2025-03-14 01:50:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:07,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459685152] [2025-03-14 01:50:07,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:07,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-14 01:50:07,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-14 01:50:07,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:07,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:50:07,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459685152] [2025-03-14 01:50:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459685152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:07,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:07,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:50:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383216289] [2025-03-14 01:50:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:07,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:07,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:07,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:07,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107 [2025-03-14 01:50:07,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 306 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 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-14 01:50:07,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:07,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107 [2025-03-14 01:50:07,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:07,869 INFO L124 PetriNetUnfolderBase]: 141/1023 cut-off events. [2025-03-14 01:50:07,869 INFO L125 PetriNetUnfolderBase]: For 138/165 co-relation queries the response was YES. [2025-03-14 01:50:07,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1023 events. 141/1023 cut-off events. For 138/165 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7107 event pairs, 43 based on Foata normal form. 15/973 useless extension candidates. Maximal degree in co-relation 974. Up to 189 conditions per place. [2025-03-14 01:50:07,874 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 23 selfloop transitions, 6 changer transitions 6/125 dead transitions. [2025-03-14 01:50:07,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 125 transitions, 406 flow [2025-03-14 01:50:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2025-03-14 01:50:07,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8598130841121495 [2025-03-14 01:50:07,876 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 306 flow. Second operand 6 states and 552 transitions. [2025-03-14 01:50:07,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 125 transitions, 406 flow [2025-03-14 01:50:07,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 125 transitions, 394 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:50:07,879 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 312 flow [2025-03-14 01:50:07,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-03-14 01:50:07,879 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2025-03-14 01:50:07,879 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 312 flow [2025-03-14 01:50:07,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 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-14 01:50:07,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:07,880 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:07,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:50:07,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-14 01:50:07,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash -719808219, now seen corresponding path program 1 times [2025-03-14 01:50:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:07,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024377855] [2025-03-14 01:50:07,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:07,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:50:07,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:50:07,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:07,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:50:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024377855] [2025-03-14 01:50:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024377855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:07,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:07,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:07,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893474974] [2025-03-14 01:50:07,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:07,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:07,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:07,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:07,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:07,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2025-03-14 01:50:07,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-14 01:50:07,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:07,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2025-03-14 01:50:07,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:07,973 INFO L124 PetriNetUnfolderBase]: 56/628 cut-off events. [2025-03-14 01:50:07,973 INFO L125 PetriNetUnfolderBase]: For 215/280 co-relation queries the response was YES. [2025-03-14 01:50:07,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 628 events. 56/628 cut-off events. For 215/280 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3805 event pairs, 30 based on Foata normal form. 3/608 useless extension candidates. Maximal degree in co-relation 892. Up to 119 conditions per place. [2025-03-14 01:50:07,975 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 7 changer transitions 1/119 dead transitions. [2025-03-14 01:50:07,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 389 flow [2025-03-14 01:50:07,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2025-03-14 01:50:07,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9221183800623053 [2025-03-14 01:50:07,977 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 312 flow. Second operand 3 states and 296 transitions. [2025-03-14 01:50:07,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 389 flow [2025-03-14 01:50:07,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 119 transitions, 381 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:50:07,979 INFO L231 Difference]: Finished difference. Result has 120 places, 115 transitions, 354 flow [2025-03-14 01:50:07,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=120, PETRI_TRANSITIONS=115} [2025-03-14 01:50:07,979 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 11 predicate places. [2025-03-14 01:50:07,979 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 115 transitions, 354 flow [2025-03-14 01:50:07,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-14 01:50:07,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:07,980 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:07,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:50:07,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-14 01:50:07,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:07,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2587284, now seen corresponding path program 1 times [2025-03-14 01:50:07,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:07,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617867955] [2025-03-14 01:50:07,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:07,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:07,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:50:07,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:50:07,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:07,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:07,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:50:08,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:50:08,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:50:08,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:08,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:08,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:50:08,017 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:50:08,017 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-14 01:50:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-14 01:50:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-14 01:50:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-14 01:50:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-14 01:50:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-14 01:50:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-14 01:50:08,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:50:08,018 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:08,018 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:50:08,018 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:50:08,034 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:50:08,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 125 transitions, 277 flow [2025-03-14 01:50:08,057 INFO L124 PetriNetUnfolderBase]: 9/338 cut-off events. [2025-03-14 01:50:08,057 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-14 01:50:08,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 338 events. 9/338 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 955 event pairs, 1 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 213. Up to 12 conditions per place. [2025-03-14 01:50:08,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 125 transitions, 277 flow [2025-03-14 01:50:08,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 125 transitions, 277 flow [2025-03-14 01:50:08,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:50:08,062 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;@1254ff24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:50:08,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-14 01:50:08,064 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:50:08,064 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-14 01:50:08,064 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:50:08,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:08,064 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-14 01:50:08,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-14 01:50:08,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash 752326282, now seen corresponding path program 1 times [2025-03-14 01:50:08,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:08,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044646829] [2025-03-14 01:50:08,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:08,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:08,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:50:08,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:50:08,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:08,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:08,085 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-14 01:50:08,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:08,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044646829] [2025-03-14 01:50:08,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044646829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:08,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:08,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337057328] [2025-03-14 01:50:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:08,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:08,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:08,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:08,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 125 [2025-03-14 01:50:08,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-14 01:50:08,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:08,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 125 [2025-03-14 01:50:08,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:08,422 INFO L124 PetriNetUnfolderBase]: 1071/4022 cut-off events. [2025-03-14 01:50:08,422 INFO L125 PetriNetUnfolderBase]: For 401/506 co-relation queries the response was YES. [2025-03-14 01:50:08,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5937 conditions, 4022 events. 1071/4022 cut-off events. For 401/506 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 36152 event pairs, 542 based on Foata normal form. 1/3582 useless extension candidates. Maximal degree in co-relation 4652. Up to 1110 conditions per place. [2025-03-14 01:50:08,447 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 23 selfloop transitions, 5 changer transitions 1/134 dead transitions. [2025-03-14 01:50:08,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 134 transitions, 351 flow [2025-03-14 01:50:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2025-03-14 01:50:08,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.928 [2025-03-14 01:50:08,449 INFO L175 Difference]: Start difference. First operand has 128 places, 125 transitions, 277 flow. Second operand 3 states and 348 transitions. [2025-03-14 01:50:08,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 134 transitions, 351 flow [2025-03-14 01:50:08,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 134 transitions, 351 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:50:08,452 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 311 flow [2025-03-14 01:50:08,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2025-03-14 01:50:08,452 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places. [2025-03-14 01:50:08,452 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 311 flow [2025-03-14 01:50:08,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-14 01:50:08,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:08,453 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] [2025-03-14 01:50:08,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:50:08,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-14 01:50:08,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:08,453 INFO L85 PathProgramCache]: Analyzing trace with hash -975665776, now seen corresponding path program 1 times [2025-03-14 01:50:08,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:08,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547325154] [2025-03-14 01:50:08,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:08,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:08,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:50:08,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:50:08,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:08,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:08,594 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-14 01:50:08,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:08,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547325154] [2025-03-14 01:50:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547325154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:08,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:08,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:08,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039258437] [2025-03-14 01:50:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:08,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:08,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:08,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:08,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:08,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 125 [2025-03-14 01:50:08,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 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-14 01:50:08,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:08,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 125 [2025-03-14 01:50:08,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:09,172 INFO L124 PetriNetUnfolderBase]: 1992/6696 cut-off events. [2025-03-14 01:50:09,173 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2025-03-14 01:50:09,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10664 conditions, 6696 events. 1992/6696 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 66992 event pairs, 898 based on Foata normal form. 0/6018 useless extension candidates. Maximal degree in co-relation 6902. Up to 2168 conditions per place. [2025-03-14 01:50:09,201 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 48 selfloop transitions, 5 changer transitions 0/150 dead transitions. [2025-03-14 01:50:09,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 150 transitions, 463 flow [2025-03-14 01:50:09,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2025-03-14 01:50:09,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.824 [2025-03-14 01:50:09,203 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 311 flow. Second operand 6 states and 618 transitions. [2025-03-14 01:50:09,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 150 transitions, 463 flow [2025-03-14 01:50:09,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 150 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:09,208 INFO L231 Difference]: Finished difference. Result has 133 places, 126 transitions, 309 flow [2025-03-14 01:50:09,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=133, PETRI_TRANSITIONS=126} [2025-03-14 01:50:09,209 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2025-03-14 01:50:09,209 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 126 transitions, 309 flow [2025-03-14 01:50:09,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 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-14 01:50:09,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:09,209 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] [2025-03-14 01:50:09,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:50:09,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-14 01:50:09,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:09,210 INFO L85 PathProgramCache]: Analyzing trace with hash 846754568, now seen corresponding path program 1 times [2025-03-14 01:50:09,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:09,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179221756] [2025-03-14 01:50:09,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:09,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:50:09,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:50:09,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:09,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:09,247 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-14 01:50:09,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:09,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179221756] [2025-03-14 01:50:09,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179221756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:09,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:09,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:09,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787567307] [2025-03-14 01:50:09,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:09,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:50:09,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:09,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:50:09,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:50:09,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 125 [2025-03-14 01:50:09,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 126 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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-14 01:50:09,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:09,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 125 [2025-03-14 01:50:09,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:09,721 INFO L124 PetriNetUnfolderBase]: 1326/6241 cut-off events. [2025-03-14 01:50:09,722 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-14 01:50:09,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8873 conditions, 6241 events. 1326/6241 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 63371 event pairs, 760 based on Foata normal form. 1/5483 useless extension candidates. Maximal degree in co-relation 3021. Up to 1720 conditions per place. [2025-03-14 01:50:09,748 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 24 selfloop transitions, 2 changer transitions 5/134 dead transitions. [2025-03-14 01:50:09,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 387 flow [2025-03-14 01:50:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2025-03-14 01:50:09,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8506666666666667 [2025-03-14 01:50:09,750 INFO L175 Difference]: Start difference. First operand has 133 places, 126 transitions, 309 flow. Second operand 6 states and 638 transitions. [2025-03-14 01:50:09,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 387 flow [2025-03-14 01:50:09,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 134 transitions, 377 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:50:09,752 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 321 flow [2025-03-14 01:50:09,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2025-03-14 01:50:09,753 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2025-03-14 01:50:09,753 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 321 flow [2025-03-14 01:50:09,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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-14 01:50:09,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:09,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:50:09,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-14 01:50:09,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash -156544253, now seen corresponding path program 1 times [2025-03-14 01:50:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105286126] [2025-03-14 01:50:09,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:09,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:50:09,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:50:09,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:09,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:09,775 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-14 01:50:09,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:09,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105286126] [2025-03-14 01:50:09,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105286126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:09,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:09,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799966409] [2025-03-14 01:50:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:09,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:09,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:09,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:09,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:09,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 125 [2025-03-14 01:50:09,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:09,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:09,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 125 [2025-03-14 01:50:09,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:10,333 INFO L124 PetriNetUnfolderBase]: 1740/6603 cut-off events. [2025-03-14 01:50:10,333 INFO L125 PetriNetUnfolderBase]: For 1609/2214 co-relation queries the response was YES. [2025-03-14 01:50:10,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11194 conditions, 6603 events. 1740/6603 cut-off events. For 1609/2214 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 68860 event pairs, 967 based on Foata normal form. 10/5862 useless extension candidates. Maximal degree in co-relation 11135. Up to 2240 conditions per place. [2025-03-14 01:50:10,373 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 29 selfloop transitions, 9 changer transitions 0/142 dead transitions. [2025-03-14 01:50:10,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 142 transitions, 455 flow [2025-03-14 01:50:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2025-03-14 01:50:10,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9226666666666666 [2025-03-14 01:50:10,375 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 321 flow. Second operand 3 states and 346 transitions. [2025-03-14 01:50:10,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 142 transitions, 455 flow [2025-03-14 01:50:10,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 443 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 01:50:10,386 INFO L231 Difference]: Finished difference. Result has 134 places, 134 transitions, 385 flow [2025-03-14 01:50:10,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=134, PETRI_TRANSITIONS=134} [2025-03-14 01:50:10,387 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2025-03-14 01:50:10,387 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 134 transitions, 385 flow [2025-03-14 01:50:10,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:10,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:10,387 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] [2025-03-14 01:50:10,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:50:10,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-14 01:50:10,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash 544811576, now seen corresponding path program 1 times [2025-03-14 01:50:10,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:10,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592195552] [2025-03-14 01:50:10,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:10,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:10,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-14 01:50:10,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:50:10,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:10,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:10,571 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-14 01:50:10,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:10,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592195552] [2025-03-14 01:50:10,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592195552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:10,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:10,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:10,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968447052] [2025-03-14 01:50:10,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:10,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:10,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:10,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:10,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:10,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 125 [2025-03-14 01:50:10,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 134 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-14 01:50:10,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:10,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 125 [2025-03-14 01:50:10,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:11,256 INFO L124 PetriNetUnfolderBase]: 2874/10393 cut-off events. [2025-03-14 01:50:11,256 INFO L125 PetriNetUnfolderBase]: For 1710/2279 co-relation queries the response was YES. [2025-03-14 01:50:11,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17543 conditions, 10393 events. 2874/10393 cut-off events. For 1710/2279 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 114895 event pairs, 1408 based on Foata normal form. 27/9250 useless extension candidates. Maximal degree in co-relation 13956. Up to 2157 conditions per place. [2025-03-14 01:50:11,320 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 46 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2025-03-14 01:50:11,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 157 transitions, 533 flow [2025-03-14 01:50:11,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2025-03-14 01:50:11,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8373333333333334 [2025-03-14 01:50:11,324 INFO L175 Difference]: Start difference. First operand has 134 places, 134 transitions, 385 flow. Second operand 6 states and 628 transitions. [2025-03-14 01:50:11,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 157 transitions, 533 flow [2025-03-14 01:50:11,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 157 transitions, 515 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:11,333 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 375 flow [2025-03-14 01:50:11,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-03-14 01:50:11,333 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 8 predicate places. [2025-03-14 01:50:11,333 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 375 flow [2025-03-14 01:50:11,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-14 01:50:11,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:11,334 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] [2025-03-14 01:50:11,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:50:11,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-14 01:50:11,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2097306113, now seen corresponding path program 1 times [2025-03-14 01:50:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:11,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151695423] [2025-03-14 01:50:11,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:11,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-14 01:50:11,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-14 01:50:11,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:11,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:11,396 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-14 01:50:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:11,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151695423] [2025-03-14 01:50:11,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151695423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:11,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:11,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:50:11,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967806563] [2025-03-14 01:50:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:11,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:11,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:11,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:11,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2025-03-14 01:50:11,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 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-14 01:50:11,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:11,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2025-03-14 01:50:11,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:11,847 INFO L124 PetriNetUnfolderBase]: 1307/6235 cut-off events. [2025-03-14 01:50:11,847 INFO L125 PetriNetUnfolderBase]: For 994/1251 co-relation queries the response was YES. [2025-03-14 01:50:11,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10208 conditions, 6235 events. 1307/6235 cut-off events. For 994/1251 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 64611 event pairs, 664 based on Foata normal form. 65/5759 useless extension candidates. Maximal degree in co-relation 5448. Up to 1257 conditions per place. [2025-03-14 01:50:11,877 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 38 selfloop transitions, 6 changer transitions 0/152 dead transitions. [2025-03-14 01:50:11,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 152 transitions, 512 flow [2025-03-14 01:50:11,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions. [2025-03-14 01:50:11,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.86 [2025-03-14 01:50:11,879 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 375 flow. Second operand 6 states and 645 transitions. [2025-03-14 01:50:11,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 152 transitions, 512 flow [2025-03-14 01:50:11,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 500 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:50:11,883 INFO L231 Difference]: Finished difference. Result has 138 places, 135 transitions, 391 flow [2025-03-14 01:50:11,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=138, PETRI_TRANSITIONS=135} [2025-03-14 01:50:11,883 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 10 predicate places. [2025-03-14 01:50:11,883 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 135 transitions, 391 flow [2025-03-14 01:50:11,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 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-14 01:50:11,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:11,884 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:11,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:50:11,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-14 01:50:11,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1834334398, now seen corresponding path program 1 times [2025-03-14 01:50:11,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:11,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8592061] [2025-03-14 01:50:11,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:11,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:50:11,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:50:11,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:11,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:11,906 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-14 01:50:11,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:11,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8592061] [2025-03-14 01:50:11,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8592061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:11,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:11,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:11,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625739746] [2025-03-14 01:50:11,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:11,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:11,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:11,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:11,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:11,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 125 [2025-03-14 01:50:11,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 135 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-14 01:50:11,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:11,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 125 [2025-03-14 01:50:11,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:12,234 INFO L124 PetriNetUnfolderBase]: 1088/4910 cut-off events. [2025-03-14 01:50:12,235 INFO L125 PetriNetUnfolderBase]: For 2475/2714 co-relation queries the response was YES. [2025-03-14 01:50:12,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9012 conditions, 4910 events. 1088/4910 cut-off events. For 2475/2714 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 51379 event pairs, 589 based on Foata normal form. 8/4547 useless extension candidates. Maximal degree in co-relation 8255. Up to 1450 conditions per place. [2025-03-14 01:50:12,257 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 31 selfloop transitions, 13 changer transitions 0/151 dead transitions. [2025-03-14 01:50:12,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 151 transitions, 552 flow [2025-03-14 01:50:12,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2025-03-14 01:50:12,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.92 [2025-03-14 01:50:12,258 INFO L175 Difference]: Start difference. First operand has 138 places, 135 transitions, 391 flow. Second operand 3 states and 345 transitions. [2025-03-14 01:50:12,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 151 transitions, 552 flow [2025-03-14 01:50:12,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 151 transitions, 544 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:50:12,261 INFO L231 Difference]: Finished difference. Result has 139 places, 144 transitions, 501 flow [2025-03-14 01:50:12,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=139, PETRI_TRANSITIONS=144} [2025-03-14 01:50:12,262 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 11 predicate places. [2025-03-14 01:50:12,262 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 144 transitions, 501 flow [2025-03-14 01:50:12,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-14 01:50:12,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:12,262 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:12,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:50:12,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-14 01:50:12,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1020903126, now seen corresponding path program 1 times [2025-03-14 01:50:12,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:12,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182530605] [2025-03-14 01:50:12,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:12,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:12,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:50:12,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:50:12,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:12,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:12,316 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-14 01:50:12,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:12,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182530605] [2025-03-14 01:50:12,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182530605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:12,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:12,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:50:12,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87497445] [2025-03-14 01:50:12,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:12,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:12,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:12,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:12,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:12,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 125 [2025-03-14 01:50:12,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 144 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-14 01:50:12,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:12,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 125 [2025-03-14 01:50:12,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:12,419 INFO L124 PetriNetUnfolderBase]: 117/1565 cut-off events. [2025-03-14 01:50:12,420 INFO L125 PetriNetUnfolderBase]: For 697/739 co-relation queries the response was YES. [2025-03-14 01:50:12,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2580 conditions, 1565 events. 117/1565 cut-off events. For 697/739 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 12821 event pairs, 43 based on Foata normal form. 21/1532 useless extension candidates. Maximal degree in co-relation 2091. Up to 144 conditions per place. [2025-03-14 01:50:12,425 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 12 selfloop transitions, 6 changer transitions 0/139 dead transitions. [2025-03-14 01:50:12,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 474 flow [2025-03-14 01:50:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2025-03-14 01:50:12,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.944 [2025-03-14 01:50:12,426 INFO L175 Difference]: Start difference. First operand has 139 places, 144 transitions, 501 flow. Second operand 3 states and 354 transitions. [2025-03-14 01:50:12,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 474 flow [2025-03-14 01:50:12,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 139 transitions, 460 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:12,430 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 405 flow [2025-03-14 01:50:12,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2025-03-14 01:50:12,430 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 11 predicate places. [2025-03-14 01:50:12,430 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 405 flow [2025-03-14 01:50:12,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-14 01:50:12,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:12,431 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:12,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:50:12,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-14 01:50:12,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2026314722, now seen corresponding path program 1 times [2025-03-14 01:50:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313828115] [2025-03-14 01:50:12,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:12,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:12,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-14 01:50:12,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-14 01:50:12,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:12,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:12,462 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-14 01:50:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:12,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313828115] [2025-03-14 01:50:12,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313828115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:12,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671688853] [2025-03-14 01:50:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:12,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:12,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:12,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:12,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 125 [2025-03-14 01:50:12,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-14 01:50:12,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:12,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 125 [2025-03-14 01:50:12,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:12,594 INFO L124 PetriNetUnfolderBase]: 203/1858 cut-off events. [2025-03-14 01:50:12,594 INFO L125 PetriNetUnfolderBase]: For 1335/1400 co-relation queries the response was YES. [2025-03-14 01:50:12,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3433 conditions, 1858 events. 203/1858 cut-off events. For 1335/1400 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 16330 event pairs, 134 based on Foata normal form. 3/1769 useless extension candidates. Maximal degree in co-relation 2878. Up to 435 conditions per place. [2025-03-14 01:50:12,599 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 25 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-03-14 01:50:12,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 487 flow [2025-03-14 01:50:12,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-03-14 01:50:12,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9013333333333333 [2025-03-14 01:50:12,600 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 405 flow. Second operand 3 states and 338 transitions. [2025-03-14 01:50:12,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 487 flow [2025-03-14 01:50:12,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 139 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:50:12,602 INFO L231 Difference]: Finished difference. Result has 142 places, 137 transitions, 439 flow [2025-03-14 01:50:12,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=439, PETRI_PLACES=142, PETRI_TRANSITIONS=137} [2025-03-14 01:50:12,603 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 14 predicate places. [2025-03-14 01:50:12,603 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 137 transitions, 439 flow [2025-03-14 01:50:12,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-14 01:50:12,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:12,604 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-14 01:50:12,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:50:12,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-14 01:50:12,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:12,605 INFO L85 PathProgramCache]: Analyzing trace with hash -800807183, now seen corresponding path program 1 times [2025-03-14 01:50:12,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:12,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108573342] [2025-03-14 01:50:12,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:12,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:12,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-14 01:50:12,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-14 01:50:12,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:12,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:12,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:50:12,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-14 01:50:12,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-14 01:50:12,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:12,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:12,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:50:12,652 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:50:12,652 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-14 01:50:12,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-14 01:50:12,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-14 01:50:12,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-14 01:50:12,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-14 01:50:12,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-14 01:50:12,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-14 01:50:12,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-14 01:50:12,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:50:12,653 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:12,654 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:50:12,654 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 01:50:12,670 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 01:50:12,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 143 transitions, 326 flow [2025-03-14 01:50:12,704 INFO L124 PetriNetUnfolderBase]: 22/571 cut-off events. [2025-03-14 01:50:12,704 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-14 01:50:12,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 571 events. 22/571 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2106 event pairs, 6 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 358. Up to 32 conditions per place. [2025-03-14 01:50:12,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 143 transitions, 326 flow [2025-03-14 01:50:12,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 143 transitions, 326 flow [2025-03-14 01:50:12,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:50:12,708 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;@1254ff24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:50:12,709 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-14 01:50:12,710 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:50:12,710 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-14 01:50:12,711 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:50:12,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:12,711 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-14 01:50:12,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:12,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1473968534, now seen corresponding path program 1 times [2025-03-14 01:50:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:12,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378066982] [2025-03-14 01:50:12,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:12,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:12,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:50:12,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:50:12,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:12,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:12,736 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-14 01:50:12,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:12,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378066982] [2025-03-14 01:50:12,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378066982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:12,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:12,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:12,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012303554] [2025-03-14 01:50:12,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:12,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:12,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:12,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:12,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:12,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 143 [2025-03-14 01:50:12,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 143 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-14 01:50:12,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:12,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 143 [2025-03-14 01:50:12,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:14,353 INFO L124 PetriNetUnfolderBase]: 7859/23535 cut-off events. [2025-03-14 01:50:14,353 INFO L125 PetriNetUnfolderBase]: For 2444/2795 co-relation queries the response was YES. [2025-03-14 01:50:14,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35885 conditions, 23535 events. 7859/23535 cut-off events. For 2444/2795 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 270975 event pairs, 4292 based on Foata normal form. 1/21316 useless extension candidates. Maximal degree in co-relation 28583. Up to 7653 conditions per place. [2025-03-14 01:50:14,458 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 30 selfloop transitions, 6 changer transitions 1/155 dead transitions. [2025-03-14 01:50:14,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 155 transitions, 422 flow [2025-03-14 01:50:14,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-03-14 01:50:14,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9207459207459208 [2025-03-14 01:50:14,460 INFO L175 Difference]: Start difference. First operand has 147 places, 143 transitions, 326 flow. Second operand 3 states and 395 transitions. [2025-03-14 01:50:14,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 155 transitions, 422 flow [2025-03-14 01:50:14,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 155 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:50:14,462 INFO L231 Difference]: Finished difference. Result has 151 places, 146 transitions, 368 flow [2025-03-14 01:50:14,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=151, PETRI_TRANSITIONS=146} [2025-03-14 01:50:14,463 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 4 predicate places. [2025-03-14 01:50:14,463 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 368 flow [2025-03-14 01:50:14,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-14 01:50:14,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:14,463 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] [2025-03-14 01:50:14,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 01:50:14,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:14,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:14,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1551265968, now seen corresponding path program 1 times [2025-03-14 01:50:14,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:14,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843602390] [2025-03-14 01:50:14,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:14,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:50:14,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:50:14,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:14,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:14,585 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-14 01:50:14,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843602390] [2025-03-14 01:50:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843602390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:14,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955930350] [2025-03-14 01:50:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:14,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:14,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:14,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:14,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 143 [2025-03-14 01:50:14,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 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-14 01:50:14,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:14,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 143 [2025-03-14 01:50:14,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:17,796 INFO L124 PetriNetUnfolderBase]: 13638/36400 cut-off events. [2025-03-14 01:50:17,797 INFO L125 PetriNetUnfolderBase]: For 3211/3211 co-relation queries the response was YES. [2025-03-14 01:50:17,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60528 conditions, 36400 events. 13638/36400 cut-off events. For 3211/3211 co-relation queries the response was YES. Maximal size of possible extension queue 1438. Compared 434798 event pairs, 2826 based on Foata normal form. 0/31775 useless extension candidates. Maximal degree in co-relation 35745. Up to 13302 conditions per place. [2025-03-14 01:50:18,013 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 60 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2025-03-14 01:50:18,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 177 transitions, 560 flow [2025-03-14 01:50:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2025-03-14 01:50:18,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8321678321678322 [2025-03-14 01:50:18,015 INFO L175 Difference]: Start difference. First operand has 151 places, 146 transitions, 368 flow. Second operand 6 states and 714 transitions. [2025-03-14 01:50:18,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 177 transitions, 560 flow [2025-03-14 01:50:18,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 177 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:18,054 INFO L231 Difference]: Finished difference. Result has 152 places, 145 transitions, 364 flow [2025-03-14 01:50:18,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=152, PETRI_TRANSITIONS=145} [2025-03-14 01:50:18,055 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 5 predicate places. [2025-03-14 01:50:18,055 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 145 transitions, 364 flow [2025-03-14 01:50:18,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 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-14 01:50:18,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:18,056 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] [2025-03-14 01:50:18,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 01:50:18,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:18,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash 271154376, now seen corresponding path program 1 times [2025-03-14 01:50:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10683632] [2025-03-14 01:50:18,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:18,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:50:18,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:50:18,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:18,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:18,095 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-14 01:50:18,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:18,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10683632] [2025-03-14 01:50:18,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10683632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:18,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680456903] [2025-03-14 01:50:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:18,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:50:18,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:18,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:50:18,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:50:18,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2025-03-14 01:50:18,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 145 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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-14 01:50:18,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:18,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2025-03-14 01:50:18,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:21,006 INFO L124 PetriNetUnfolderBase]: 9343/33719 cut-off events. [2025-03-14 01:50:21,006 INFO L125 PetriNetUnfolderBase]: For 1637/1637 co-relation queries the response was YES. [2025-03-14 01:50:21,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49426 conditions, 33719 events. 9343/33719 cut-off events. For 1637/1637 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 429889 event pairs, 7523 based on Foata normal form. 1/29645 useless extension candidates. Maximal degree in co-relation 31640. Up to 10778 conditions per place. [2025-03-14 01:50:21,269 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 28 selfloop transitions, 2 changer transitions 5/153 dead transitions. [2025-03-14 01:50:21,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 153 transitions, 450 flow [2025-03-14 01:50:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2025-03-14 01:50:21,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2025-03-14 01:50:21,271 INFO L175 Difference]: Start difference. First operand has 152 places, 145 transitions, 364 flow. Second operand 6 states and 726 transitions. [2025-03-14 01:50:21,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 153 transitions, 450 flow [2025-03-14 01:50:21,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 153 transitions, 440 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:50:21,275 INFO L231 Difference]: Finished difference. Result has 156 places, 146 transitions, 376 flow [2025-03-14 01:50:21,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=156, PETRI_TRANSITIONS=146} [2025-03-14 01:50:21,276 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2025-03-14 01:50:21,276 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 146 transitions, 376 flow [2025-03-14 01:50:21,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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-14 01:50:21,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:21,276 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] [2025-03-14 01:50:21,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 01:50:21,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:21,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:21,277 INFO L85 PathProgramCache]: Analyzing trace with hash -816254973, now seen corresponding path program 1 times [2025-03-14 01:50:21,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:21,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288689510] [2025-03-14 01:50:21,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:21,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:50:21,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:50:21,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:21,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:21,299 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-14 01:50:21,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:21,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288689510] [2025-03-14 01:50:21,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288689510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:21,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:21,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:21,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591950631] [2025-03-14 01:50:21,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:21,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:21,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:21,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:21,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:21,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2025-03-14 01:50:21,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 146 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-14 01:50:21,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:21,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2025-03-14 01:50:21,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:24,822 INFO L124 PetriNetUnfolderBase]: 13629/41376 cut-off events. [2025-03-14 01:50:24,823 INFO L125 PetriNetUnfolderBase]: For 10574/13633 co-relation queries the response was YES. [2025-03-14 01:50:24,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72233 conditions, 41376 events. 13629/41376 cut-off events. For 10574/13633 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 529655 event pairs, 7860 based on Foata normal form. 36/36839 useless extension candidates. Maximal degree in co-relation 72173. Up to 15880 conditions per place. [2025-03-14 01:50:25,094 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 39 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2025-03-14 01:50:25,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 167 transitions, 562 flow [2025-03-14 01:50:25,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-03-14 01:50:25,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9207459207459208 [2025-03-14 01:50:25,095 INFO L175 Difference]: Start difference. First operand has 156 places, 146 transitions, 376 flow. Second operand 3 states and 395 transitions. [2025-03-14 01:50:25,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 167 transitions, 562 flow [2025-03-14 01:50:25,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 167 transitions, 550 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 01:50:25,217 INFO L231 Difference]: Finished difference. Result has 153 places, 155 transitions, 460 flow [2025-03-14 01:50:25,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=153, PETRI_TRANSITIONS=155} [2025-03-14 01:50:25,218 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 6 predicate places. [2025-03-14 01:50:25,218 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 155 transitions, 460 flow [2025-03-14 01:50:25,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-14 01:50:25,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:25,218 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] [2025-03-14 01:50:25,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 01:50:25,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:25,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:25,219 INFO L85 PathProgramCache]: Analyzing trace with hash -911529449, now seen corresponding path program 1 times [2025-03-14 01:50:25,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:25,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640921262] [2025-03-14 01:50:25,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:25,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:25,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-14 01:50:25,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:50:25,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:25,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:50:25,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:25,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640921262] [2025-03-14 01:50:25,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640921262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:25,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:25,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:25,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378912855] [2025-03-14 01:50:25,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:25,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:25,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:25,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:25,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:25,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 143 [2025-03-14 01:50:25,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 155 transitions, 460 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-14 01:50:25,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:25,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 143 [2025-03-14 01:50:25,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:29,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_6| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_6|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][152], [172#true, 20#L1038-2true, 110#L1024-3true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 95#L1022true, Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 147#true, Black: 152#(= |#race~data~0| 0), 46#L1023-1true, 144#true, 142#true]) [2025-03-14 01:50:29,219 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:29,220 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:29,220 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:29,220 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:29,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L1023-3-->L1023-1: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][184], [20#L1038-2true, 172#true, 59#L1023-2true, 77#L1023-1true, 148#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 46#L1023-1true, 142#true]) [2025-03-14 01:50:29,305 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:50:29,305 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:29,305 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:29,305 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:29,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_6| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_6|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][152], [20#L1038-2true, 172#true, 70#L1023-1true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 147#true, Black: 152#(= |#race~data~0| 0), 21#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 46#L1023-1true, 144#true, 142#true]) [2025-03-14 01:50:29,350 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:50:29,350 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:29,350 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:29,350 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:29,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L1023-3-->L1023-1: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][179], [20#L1038-2true, 172#true, 110#L1024-3true, 77#L1023-1true, 148#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 46#L1023-1true, 142#true]) [2025-03-14 01:50:29,925 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is not cut-off event [2025-03-14 01:50:29,925 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-03-14 01:50:29,925 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-03-14 01:50:29,925 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-03-14 01:50:30,375 INFO L124 PetriNetUnfolderBase]: 19999/58031 cut-off events. [2025-03-14 01:50:30,376 INFO L125 PetriNetUnfolderBase]: For 9636/13605 co-relation queries the response was YES. [2025-03-14 01:50:30,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100957 conditions, 58031 events. 19999/58031 cut-off events. For 9636/13605 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 761479 event pairs, 9797 based on Foata normal form. 80/50818 useless extension candidates. Maximal degree in co-relation 79535. Up to 12713 conditions per place. [2025-03-14 01:50:30,829 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 58 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2025-03-14 01:50:30,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 186 transitions, 648 flow [2025-03-14 01:50:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2025-03-14 01:50:30,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8438228438228438 [2025-03-14 01:50:30,831 INFO L175 Difference]: Start difference. First operand has 153 places, 155 transitions, 460 flow. Second operand 6 states and 724 transitions. [2025-03-14 01:50:30,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 186 transitions, 648 flow [2025-03-14 01:50:30,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 186 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:30,902 INFO L231 Difference]: Finished difference. Result has 155 places, 154 transitions, 446 flow [2025-03-14 01:50:30,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=155, PETRI_TRANSITIONS=154} [2025-03-14 01:50:30,903 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 8 predicate places. [2025-03-14 01:50:30,903 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 446 flow [2025-03-14 01:50:30,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-14 01:50:30,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:30,903 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] [2025-03-14 01:50:30,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-14 01:50:30,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:30,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1767069742, now seen corresponding path program 1 times [2025-03-14 01:50:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:30,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382890465] [2025-03-14 01:50:30,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:30,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:30,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-14 01:50:30,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-14 01:50:30,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:30,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:50:30,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:30,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382890465] [2025-03-14 01:50:30,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382890465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:30,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:30,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:50:30,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897666240] [2025-03-14 01:50:30,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:30,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:30,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:30,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:30,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:31,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 143 [2025-03-14 01:50:31,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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-14 01:50:31,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:31,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 143 [2025-03-14 01:50:31,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:33,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L1023-3-->L1023-1: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][175], [20#L1038-2true, 59#L1023-2true, 77#L1023-1true, 148#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 46#L1023-1true, 142#true]) [2025-03-14 01:50:33,279 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:50:33,279 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:33,279 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:33,279 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:33,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L1023-3-->L1023-1: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][174], [20#L1038-2true, 110#L1024-3true, 77#L1023-1true, 148#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 146#true, Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 46#L1023-1true, 142#true]) [2025-03-14 01:50:33,802 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is not cut-off event [2025-03-14 01:50:33,802 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-03-14 01:50:33,802 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-03-14 01:50:33,802 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-03-14 01:50:34,075 INFO L124 PetriNetUnfolderBase]: 10063/36474 cut-off events. [2025-03-14 01:50:34,075 INFO L125 PetriNetUnfolderBase]: For 6131/8102 co-relation queries the response was YES. [2025-03-14 01:50:34,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61443 conditions, 36474 events. 10063/36474 cut-off events. For 6131/8102 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 476573 event pairs, 4496 based on Foata normal form. 284/32609 useless extension candidates. Maximal degree in co-relation 31539. Up to 7614 conditions per place. [2025-03-14 01:50:34,269 INFO L140 encePairwiseOnDemand]: 136/143 looper letters, 47 selfloop transitions, 6 changer transitions 0/178 dead transitions. [2025-03-14 01:50:34,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 178 transitions, 614 flow [2025-03-14 01:50:34,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2025-03-14 01:50:34,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8601398601398601 [2025-03-14 01:50:34,270 INFO L175 Difference]: Start difference. First operand has 155 places, 154 transitions, 446 flow. Second operand 6 states and 738 transitions. [2025-03-14 01:50:34,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 178 transitions, 614 flow [2025-03-14 01:50:34,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 178 transitions, 602 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:50:34,283 INFO L231 Difference]: Finished difference. Result has 157 places, 156 transitions, 462 flow [2025-03-14 01:50:34,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=157, PETRI_TRANSITIONS=156} [2025-03-14 01:50:34,284 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 10 predicate places. [2025-03-14 01:50:34,284 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 156 transitions, 462 flow [2025-03-14 01:50:34,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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-14 01:50:34,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:34,284 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:34,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-14 01:50:34,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:34,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:34,285 INFO L85 PathProgramCache]: Analyzing trace with hash -63508543, now seen corresponding path program 1 times [2025-03-14 01:50:34,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:34,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193308544] [2025-03-14 01:50:34,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:34,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:34,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:50:34,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:50:34,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:34,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:50:34,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:34,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193308544] [2025-03-14 01:50:34,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193308544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:34,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:34,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68763063] [2025-03-14 01:50:34,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:34,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:34,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:34,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:34,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:34,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2025-03-14 01:50:34,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 156 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-14 01:50:34,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:34,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2025-03-14 01:50:34,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:37,997 INFO L124 PetriNetUnfolderBase]: 11741/40880 cut-off events. [2025-03-14 01:50:37,997 INFO L125 PetriNetUnfolderBase]: For 22350/25427 co-relation queries the response was YES. [2025-03-14 01:50:38,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76769 conditions, 40880 events. 11741/40880 cut-off events. For 22350/25427 co-relation queries the response was YES. Maximal size of possible extension queue 1526. Compared 557587 event pairs, 6051 based on Foata normal form. 47/36748 useless extension candidates. Maximal degree in co-relation 29536. Up to 13416 conditions per place. [2025-03-14 01:50:38,262 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 43 selfloop transitions, 18 changer transitions 0/181 dead transitions. [2025-03-14 01:50:38,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 181 transitions, 707 flow [2025-03-14 01:50:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2025-03-14 01:50:38,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9184149184149184 [2025-03-14 01:50:38,263 INFO L175 Difference]: Start difference. First operand has 157 places, 156 transitions, 462 flow. Second operand 3 states and 394 transitions. [2025-03-14 01:50:38,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 181 transitions, 707 flow [2025-03-14 01:50:38,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 181 transitions, 699 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:50:38,273 INFO L231 Difference]: Finished difference. Result has 158 places, 170 transitions, 632 flow [2025-03-14 01:50:38,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=158, PETRI_TRANSITIONS=170} [2025-03-14 01:50:38,273 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 11 predicate places. [2025-03-14 01:50:38,273 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 170 transitions, 632 flow [2025-03-14 01:50:38,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-14 01:50:38,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:38,274 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:38,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-14 01:50:38,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:38,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:38,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1716709301, now seen corresponding path program 1 times [2025-03-14 01:50:38,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:38,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292447588] [2025-03-14 01:50:38,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:38,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:50:38,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:50:38,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:38,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:50:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:38,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292447588] [2025-03-14 01:50:38,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292447588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:38,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:38,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:50:38,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604805229] [2025-03-14 01:50:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:38,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:38,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:38,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:38,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 143 [2025-03-14 01:50:38,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 170 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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-14 01:50:38,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:38,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 143 [2025-03-14 01:50:38,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:38,876 INFO L124 PetriNetUnfolderBase]: 688/6745 cut-off events. [2025-03-14 01:50:38,876 INFO L125 PetriNetUnfolderBase]: For 3175/3613 co-relation queries the response was YES. [2025-03-14 01:50:38,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11139 conditions, 6745 events. 688/6745 cut-off events. For 3175/3613 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 77484 event pairs, 149 based on Foata normal form. 177/6537 useless extension candidates. Maximal degree in co-relation 4490. Up to 662 conditions per place. [2025-03-14 01:50:38,897 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 16 selfloop transitions, 8 changer transitions 0/160 dead transitions. [2025-03-14 01:50:38,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 160 transitions, 565 flow [2025-03-14 01:50:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:38,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2025-03-14 01:50:38,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2025-03-14 01:50:38,898 INFO L175 Difference]: Start difference. First operand has 158 places, 170 transitions, 632 flow. Second operand 3 states and 403 transitions. [2025-03-14 01:50:38,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 160 transitions, 565 flow [2025-03-14 01:50:38,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 160 transitions, 551 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:38,904 INFO L231 Difference]: Finished difference. Result has 158 places, 153 transitions, 472 flow [2025-03-14 01:50:38,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=158, PETRI_TRANSITIONS=153} [2025-03-14 01:50:38,904 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 11 predicate places. [2025-03-14 01:50:38,904 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 153 transitions, 472 flow [2025-03-14 01:50:38,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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-14 01:50:38,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:38,905 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:38,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-14 01:50:38,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:38,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1069221166, now seen corresponding path program 1 times [2025-03-14 01:50:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:38,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212495091] [2025-03-14 01:50:38,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:38,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-14 01:50:38,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-14 01:50:38,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:38,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 01:50:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212495091] [2025-03-14 01:50:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212495091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:38,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925103412] [2025-03-14 01:50:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:38,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:38,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:38,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:38,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2025-03-14 01:50:38,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 153 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-14 01:50:38,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:38,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2025-03-14 01:50:38,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:39,510 INFO L124 PetriNetUnfolderBase]: 1120/7987 cut-off events. [2025-03-14 01:50:39,511 INFO L125 PetriNetUnfolderBase]: For 6505/6624 co-relation queries the response was YES. [2025-03-14 01:50:39,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15239 conditions, 7987 events. 1120/7987 cut-off events. For 6505/6624 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 95947 event pairs, 661 based on Foata normal form. 4/7477 useless extension candidates. Maximal degree in co-relation 11999. Up to 2068 conditions per place. [2025-03-14 01:50:39,549 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 33 selfloop transitions, 5 changer transitions 0/160 dead transitions. [2025-03-14 01:50:39,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 160 transitions, 586 flow [2025-03-14 01:50:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2025-03-14 01:50:39,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951048951048951 [2025-03-14 01:50:39,551 INFO L175 Difference]: Start difference. First operand has 158 places, 153 transitions, 472 flow. Second operand 3 states and 384 transitions. [2025-03-14 01:50:39,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 160 transitions, 586 flow [2025-03-14 01:50:39,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 160 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:50:39,555 INFO L231 Difference]: Finished difference. Result has 161 places, 156 transitions, 504 flow [2025-03-14 01:50:39,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=161, PETRI_TRANSITIONS=156} [2025-03-14 01:50:39,557 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2025-03-14 01:50:39,557 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 156 transitions, 504 flow [2025-03-14 01:50:39,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-14 01:50:39,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:39,557 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-14 01:50:39,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-14 01:50:39,557 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:39,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash -826932976, now seen corresponding path program 1 times [2025-03-14 01:50:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731499877] [2025-03-14 01:50:39,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:39,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-14 01:50:39,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-14 01:50:39,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:39,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-14 01:50:39,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:39,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731499877] [2025-03-14 01:50:39,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731499877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:39,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:39,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:39,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815280985] [2025-03-14 01:50:39,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:39,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:39,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:39,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:39,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:39,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2025-03-14 01:50:39,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 156 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-14 01:50:39,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:39,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2025-03-14 01:50:39,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:40,336 INFO L124 PetriNetUnfolderBase]: 1121/8023 cut-off events. [2025-03-14 01:50:40,336 INFO L125 PetriNetUnfolderBase]: For 8690/8842 co-relation queries the response was YES. [2025-03-14 01:50:40,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15946 conditions, 8023 events. 1121/8023 cut-off events. For 8690/8842 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 96592 event pairs, 707 based on Foata normal form. 4/7570 useless extension candidates. Maximal degree in co-relation 12796. Up to 2095 conditions per place. [2025-03-14 01:50:40,366 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 33 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2025-03-14 01:50:40,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 162 transitions, 609 flow [2025-03-14 01:50:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-03-14 01:50:40,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8927738927738927 [2025-03-14 01:50:40,367 INFO L175 Difference]: Start difference. First operand has 161 places, 156 transitions, 504 flow. Second operand 3 states and 383 transitions. [2025-03-14 01:50:40,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 162 transitions, 609 flow [2025-03-14 01:50:40,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 162 transitions, 595 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:40,373 INFO L231 Difference]: Finished difference. Result has 163 places, 159 transitions, 532 flow [2025-03-14 01:50:40,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=163, PETRI_TRANSITIONS=159} [2025-03-14 01:50:40,374 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 16 predicate places. [2025-03-14 01:50:40,374 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 159 transitions, 532 flow [2025-03-14 01:50:40,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-14 01:50:40,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:40,374 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:50:40,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-14 01:50:40,374 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:40,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1282833234, now seen corresponding path program 1 times [2025-03-14 01:50:40,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:40,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678891135] [2025-03-14 01:50:40,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:40,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:40,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-14 01:50:40,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-14 01:50:40,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:40,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:50:40,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:40,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678891135] [2025-03-14 01:50:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678891135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:40,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:40,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:50:40,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16284113] [2025-03-14 01:50:40,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:40,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:50:40,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:40,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:50:40,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:50:40,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 143 [2025-03-14 01:50:40,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 159 transitions, 532 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 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-14 01:50:40,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:40,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 143 [2025-03-14 01:50:40,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:41,726 INFO L124 PetriNetUnfolderBase]: 2202/9523 cut-off events. [2025-03-14 01:50:41,726 INFO L125 PetriNetUnfolderBase]: For 4861/5006 co-relation queries the response was YES. [2025-03-14 01:50:41,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18105 conditions, 9523 events. 2202/9523 cut-off events. For 4861/5006 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 99252 event pairs, 429 based on Foata normal form. 110/9413 useless extension candidates. Maximal degree in co-relation 8701. Up to 1508 conditions per place. [2025-03-14 01:50:41,768 INFO L140 encePairwiseOnDemand]: 129/143 looper letters, 82 selfloop transitions, 15 changer transitions 21/241 dead transitions. [2025-03-14 01:50:41,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 241 transitions, 1017 flow [2025-03-14 01:50:41,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:50:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:50:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1536 transitions. [2025-03-14 01:50:41,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8262506724045185 [2025-03-14 01:50:41,770 INFO L175 Difference]: Start difference. First operand has 163 places, 159 transitions, 532 flow. Second operand 13 states and 1536 transitions. [2025-03-14 01:50:41,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 241 transitions, 1017 flow [2025-03-14 01:50:41,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 241 transitions, 1001 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:41,778 INFO L231 Difference]: Finished difference. Result has 182 places, 166 transitions, 608 flow [2025-03-14 01:50:41,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=608, PETRI_PLACES=182, PETRI_TRANSITIONS=166} [2025-03-14 01:50:41,778 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 35 predicate places. [2025-03-14 01:50:41,778 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 166 transitions, 608 flow [2025-03-14 01:50:41,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 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-14 01:50:41,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:41,779 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 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-14 01:50:41,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-14 01:50:41,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:50:41,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1980513663, now seen corresponding path program 1 times [2025-03-14 01:50:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:41,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892843442] [2025-03-14 01:50:41,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:41,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-14 01:50:41,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-14 01:50:41,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:41,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:41,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:50:41,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-14 01:50:41,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-14 01:50:41,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:41,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:41,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:50:41,816 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:50:41,817 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-14 01:50:41,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-14 01:50:41,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-14 01:50:41,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-14 01:50:41,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-14 01:50:41,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-14 01:50:41,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-14 01:50:41,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-14 01:50:41,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-14 01:50:41,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-14 01:50:41,817 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:41,817 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:50:41,817 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-14 01:50:41,832 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-03-14 01:50:41,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 161 transitions, 377 flow [2025-03-14 01:50:41,898 INFO L124 PetriNetUnfolderBase]: 55/1008 cut-off events. [2025-03-14 01:50:41,898 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-14 01:50:41,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 1008 events. 55/1008 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4857 event pairs, 23 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 616. Up to 80 conditions per place. [2025-03-14 01:50:41,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 161 transitions, 377 flow [2025-03-14 01:50:41,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 161 transitions, 377 flow [2025-03-14 01:50:41,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:50:41,905 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;@1254ff24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:50:41,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-14 01:50:41,906 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:50:41,907 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-14 01:50:41,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:50:41,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:41,907 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-14 01:50:41,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-14 01:50:41,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash -946987894, now seen corresponding path program 1 times [2025-03-14 01:50:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:41,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968111105] [2025-03-14 01:50:41,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:41,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:50:41,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:50:41,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:41,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:41,921 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-14 01:50:41,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:41,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968111105] [2025-03-14 01:50:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968111105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:41,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:41,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364213064] [2025-03-14 01:50:41,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:41,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:41,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:41,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:41,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 161 [2025-03-14 01:50:41,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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-14 01:50:41,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:41,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 161 [2025-03-14 01:50:41,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand