./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c --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/weaver/chl-collitem-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:42:35,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:42:35,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:42:35,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:42:35,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:42:35,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:42:35,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:42:35,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:42:35,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:42:35,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:42:35,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:42:35,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:42:35,814 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:42:35,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:42:35,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:42:35,816 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:42:35,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:42:35,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:42:35,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:42:35,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:42:35,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:42:35,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:42:35,816 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:42:35,817 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:42:35,817 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:42:35,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:42:35,817 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:42:35,817 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:42:35,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:42:35,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:42:35,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:42:35,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:35,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:42:35,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:42:35,817 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:42:35,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:42:35,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:42:35,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:42:35,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:42:35,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:42:35,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:42:35,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:42:35,818 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 -> 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c [2025-03-14 01:42:36,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:42:36,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:42:36,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:42:36,048 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:42:36,049 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:42:36,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-03-14 01:42:37,115 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2682bb9f/47cc21ae0ff84daa83bb6a013d5c22ef/FLAG19b066641 [2025-03-14 01:42:37,388 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:42:37,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-03-14 01:42:37,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2682bb9f/47cc21ae0ff84daa83bb6a013d5c22ef/FLAG19b066641 [2025-03-14 01:42:37,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2682bb9f/47cc21ae0ff84daa83bb6a013d5c22ef [2025-03-14 01:42:37,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:42:37,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:42:37,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:37,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:42:37,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:42:37,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:37" (1/1) ... [2025-03-14 01:42:37,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593a7904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37, skipping insertion in model container [2025-03-14 01:42:37,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:37" (1/1) ... [2025-03-14 01:42:37,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:42:37,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:37,867 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:42:37,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:37,903 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:42:37,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37 WrapperNode [2025-03-14 01:42:37,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:37,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:37,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:42:37,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:42:37,910 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:42:37" (1/1) ... [2025-03-14 01:42:37,919 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:42:37" (1/1) ... [2025-03-14 01:42:37,946 INFO L138 Inliner]: procedures = 21, calls = 26, calls flagged for inlining = 16, calls inlined = 30, statements flattened = 405 [2025-03-14 01:42:37,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:37,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:42:37,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:42:37,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:42:37,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37" (1/1) ... [2025-03-14 01:42:37,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37" (1/1) ... [2025-03-14 01:42:37,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37" (1/1) ... [2025-03-14 01:42:37,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37" (1/1) ... [2025-03-14 01:42:37,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37" (1/1) ... [2025-03-14 01:42:37,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37" (1/1) ... [2025-03-14 01:42:37,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37" (1/1) ... [2025-03-14 01:42:37,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37" (1/1) ... [2025-03-14 01:42:37,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:42:37,988 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:42:37,988 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:42:37,988 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:42:37,989 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37" (1/1) ... [2025-03-14 01:42:37,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:38,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:42:38,028 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:42:38,031 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:42:38,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:42:38,050 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:42:38,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:42:38,050 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:42:38,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:42:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:42:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:42:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:42:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:42:38,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:42:38,052 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:42:38,136 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:42:38,137 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:42:38,598 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:42:38,599 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:42:38,599 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:42:39,027 WARN L177 LargeBlockEncoding]: Complex 2:12 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-03-14 01:42:39,062 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:42:39,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:39 BoogieIcfgContainer [2025-03-14 01:42:39,062 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:42:39,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:42:39,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:42:39,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:42:39,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:42:37" (1/3) ... [2025-03-14 01:42:39,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53000f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:39, skipping insertion in model container [2025-03-14 01:42:39,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:37" (2/3) ... [2025-03-14 01:42:39,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53000f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:39, skipping insertion in model container [2025-03-14 01:42:39,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:39" (3/3) ... [2025-03-14 01:42:39,071 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-symm.wvr.c [2025-03-14 01:42:39,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:42:39,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-symm.wvr.c that has 3 procedures, 230 locations, 1 initial locations, 0 loop locations, and 52 error locations. [2025-03-14 01:42:39,089 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:42:39,175 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:42:39,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 247 transitions, 508 flow [2025-03-14 01:42:39,275 INFO L124 PetriNetUnfolderBase]: 18/245 cut-off events. [2025-03-14 01:42:39,277 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:39,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 245 events. 18/245 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 304 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2025-03-14 01:42:39,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 247 transitions, 508 flow [2025-03-14 01:42:39,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 225 transitions, 462 flow [2025-03-14 01:42:39,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:42:39,303 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;@3b57e690, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:42:39,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2025-03-14 01:42:39,308 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:42:39,308 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-14 01:42:39,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:42:39,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:39,309 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] [2025-03-14 01:42:39,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:39,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:39,313 INFO L85 PathProgramCache]: Analyzing trace with hash 733244434, now seen corresponding path program 1 times [2025-03-14 01:42:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702407626] [2025-03-14 01:42:39,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:39,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:42:39,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:42:39,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:39,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:39,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:42:39,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:39,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702407626] [2025-03-14 01:42:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702407626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:39,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:39,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235561321] [2025-03-14 01:42:39,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:39,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:39,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:39,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:39,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:39,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 247 [2025-03-14 01:42:39,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 225 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:39,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:39,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 247 [2025-03-14 01:42:39,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:39,553 INFO L124 PetriNetUnfolderBase]: 8/187 cut-off events. [2025-03-14 01:42:39,554 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 01:42:39,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 187 events. 8/187 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 3 based on Foata normal form. 2/167 useless extension candidates. Maximal degree in co-relation 48. Up to 19 conditions per place. [2025-03-14 01:42:39,555 INFO L140 encePairwiseOnDemand]: 195/247 looper letters, 10 selfloop transitions, 2 changer transitions 2/175 dead transitions. [2025-03-14 01:42:39,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 175 transitions, 386 flow [2025-03-14 01:42:39,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2025-03-14 01:42:39,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2025-03-14 01:42:39,568 INFO L175 Difference]: Start difference. First operand has 216 places, 225 transitions, 462 flow. Second operand 3 states and 608 transitions. [2025-03-14 01:42:39,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 175 transitions, 386 flow [2025-03-14 01:42:39,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 175 transitions, 378 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:42:39,576 INFO L231 Difference]: Finished difference. Result has 177 places, 173 transitions, 354 flow [2025-03-14 01:42:39,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=177, PETRI_TRANSITIONS=173} [2025-03-14 01:42:39,581 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -39 predicate places. [2025-03-14 01:42:39,581 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 173 transitions, 354 flow [2025-03-14 01:42:39,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:39,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:39,582 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:42:39,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:42:39,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:39,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:39,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1302508090, now seen corresponding path program 1 times [2025-03-14 01:42:39,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:39,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127185473] [2025-03-14 01:42:39,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:39,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:42:39,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:42:39,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:39,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:39,626 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:42:39,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:39,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127185473] [2025-03-14 01:42:39,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127185473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:39,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:39,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:39,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549627549] [2025-03-14 01:42:39,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:39,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:39,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:39,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:39,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:39,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 247 [2025-03-14 01:42:39,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 173 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:39,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:39,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 247 [2025-03-14 01:42:39,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:39,694 INFO L124 PetriNetUnfolderBase]: 8/184 cut-off events. [2025-03-14 01:42:39,698 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:39,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 184 events. 8/184 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 178. Up to 19 conditions per place. [2025-03-14 01:42:39,699 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 10 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2025-03-14 01:42:39,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 172 transitions, 376 flow [2025-03-14 01:42:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2025-03-14 01:42:39,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2025-03-14 01:42:39,703 INFO L175 Difference]: Start difference. First operand has 177 places, 173 transitions, 354 flow. Second operand 3 states and 559 transitions. [2025-03-14 01:42:39,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 172 transitions, 376 flow [2025-03-14 01:42:39,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:39,706 INFO L231 Difference]: Finished difference. Result has 174 places, 172 transitions, 352 flow [2025-03-14 01:42:39,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=174, PETRI_TRANSITIONS=172} [2025-03-14 01:42:39,707 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -42 predicate places. [2025-03-14 01:42:39,707 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 172 transitions, 352 flow [2025-03-14 01:42:39,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:39,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:39,708 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] [2025-03-14 01:42:39,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:42:39,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:39,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1080648636, now seen corresponding path program 1 times [2025-03-14 01:42:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:39,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286770894] [2025-03-14 01:42:39,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:39,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:42:39,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:42:39,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:39,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:39,760 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:42:39,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:39,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286770894] [2025-03-14 01:42:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286770894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:39,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:39,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:39,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518588383] [2025-03-14 01:42:39,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:39,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:39,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:39,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:39,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:39,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 247 [2025-03-14 01:42:39,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 172 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:39,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:39,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 247 [2025-03-14 01:42:39,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:39,810 INFO L124 PetriNetUnfolderBase]: 8/183 cut-off events. [2025-03-14 01:42:39,811 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:39,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 183 events. 8/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 169. Up to 19 conditions per place. [2025-03-14 01:42:39,811 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 10 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2025-03-14 01:42:39,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 171 transitions, 374 flow [2025-03-14 01:42:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2025-03-14 01:42:39,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2025-03-14 01:42:39,816 INFO L175 Difference]: Start difference. First operand has 174 places, 172 transitions, 352 flow. Second operand 3 states and 559 transitions. [2025-03-14 01:42:39,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 171 transitions, 374 flow [2025-03-14 01:42:39,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 171 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:39,821 INFO L231 Difference]: Finished difference. Result has 173 places, 171 transitions, 350 flow [2025-03-14 01:42:39,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=173, PETRI_TRANSITIONS=171} [2025-03-14 01:42:39,822 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -43 predicate places. [2025-03-14 01:42:39,822 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 171 transitions, 350 flow [2025-03-14 01:42:39,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:39,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:39,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:39,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:42:39,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:39,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:39,823 INFO L85 PathProgramCache]: Analyzing trace with hash -436816191, now seen corresponding path program 1 times [2025-03-14 01:42:39,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:39,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938170940] [2025-03-14 01:42:39,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:39,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:42:39,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:42:39,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:39,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:39,882 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:42:39,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:39,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938170940] [2025-03-14 01:42:39,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938170940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:39,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:39,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:39,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167281381] [2025-03-14 01:42:39,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:39,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:39,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:39,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:39,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 247 [2025-03-14 01:42:39,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 171 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:39,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:39,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 247 [2025-03-14 01:42:39,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:39,932 INFO L124 PetriNetUnfolderBase]: 8/182 cut-off events. [2025-03-14 01:42:39,933 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:39,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 182 events. 8/182 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 160. Up to 19 conditions per place. [2025-03-14 01:42:39,933 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 10 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2025-03-14 01:42:39,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 372 flow [2025-03-14 01:42:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2025-03-14 01:42:39,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2025-03-14 01:42:39,935 INFO L175 Difference]: Start difference. First operand has 173 places, 171 transitions, 350 flow. Second operand 3 states and 559 transitions. [2025-03-14 01:42:39,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 372 flow [2025-03-14 01:42:39,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:39,938 INFO L231 Difference]: Finished difference. Result has 172 places, 170 transitions, 348 flow [2025-03-14 01:42:39,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=172, PETRI_TRANSITIONS=170} [2025-03-14 01:42:39,939 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -44 predicate places. [2025-03-14 01:42:39,939 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 170 transitions, 348 flow [2025-03-14 01:42:39,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:39,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:39,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:39,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:42:39,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:39,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:39,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1412742861, now seen corresponding path program 1 times [2025-03-14 01:42:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:39,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735368121] [2025-03-14 01:42:39,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:39,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:39,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:42:39,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:42:39,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:39,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:39,978 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:42:39,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:39,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735368121] [2025-03-14 01:42:39,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735368121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:39,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:39,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:39,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133038014] [2025-03-14 01:42:39,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:39,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:39,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:39,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:39,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:39,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 247 [2025-03-14 01:42:39,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:39,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:39,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 247 [2025-03-14 01:42:39,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:40,043 INFO L124 PetriNetUnfolderBase]: 8/181 cut-off events. [2025-03-14 01:42:40,043 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:40,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 181 events. 8/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 151. Up to 19 conditions per place. [2025-03-14 01:42:40,044 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 10 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-03-14 01:42:40,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 169 transitions, 370 flow [2025-03-14 01:42:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2025-03-14 01:42:40,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2025-03-14 01:42:40,046 INFO L175 Difference]: Start difference. First operand has 172 places, 170 transitions, 348 flow. Second operand 3 states and 559 transitions. [2025-03-14 01:42:40,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 169 transitions, 370 flow [2025-03-14 01:42:40,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 169 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:40,049 INFO L231 Difference]: Finished difference. Result has 171 places, 169 transitions, 346 flow [2025-03-14 01:42:40,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=171, PETRI_TRANSITIONS=169} [2025-03-14 01:42:40,050 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -45 predicate places. [2025-03-14 01:42:40,050 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 169 transitions, 346 flow [2025-03-14 01:42:40,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:40,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:40,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:40,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:42:40,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:40,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1218036084, now seen corresponding path program 1 times [2025-03-14 01:42:40,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:40,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263774219] [2025-03-14 01:42:40,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:40,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:40,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-14 01:42:40,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 01:42:40,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:40,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:40,111 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:42:40,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:40,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263774219] [2025-03-14 01:42:40,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263774219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:40,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:40,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:40,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516169399] [2025-03-14 01:42:40,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:40,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:40,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:40,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:40,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 247 [2025-03-14 01:42:40,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 169 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:40,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:40,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 247 [2025-03-14 01:42:40,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:40,168 INFO L124 PetriNetUnfolderBase]: 8/180 cut-off events. [2025-03-14 01:42:40,169 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:40,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 180 events. 8/180 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 142. Up to 19 conditions per place. [2025-03-14 01:42:40,170 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 10 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2025-03-14 01:42:40,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 368 flow [2025-03-14 01:42:40,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2025-03-14 01:42:40,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2025-03-14 01:42:40,171 INFO L175 Difference]: Start difference. First operand has 171 places, 169 transitions, 346 flow. Second operand 3 states and 559 transitions. [2025-03-14 01:42:40,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 368 flow [2025-03-14 01:42:40,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:40,174 INFO L231 Difference]: Finished difference. Result has 170 places, 168 transitions, 344 flow [2025-03-14 01:42:40,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=170, PETRI_TRANSITIONS=168} [2025-03-14 01:42:40,176 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -46 predicate places. [2025-03-14 01:42:40,176 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 168 transitions, 344 flow [2025-03-14 01:42:40,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:40,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:40,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:40,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:42:40,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:40,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1308283408, now seen corresponding path program 1 times [2025-03-14 01:42:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:40,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249007199] [2025-03-14 01:42:40,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:40,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-14 01:42:40,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-14 01:42:40,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:40,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:40,226 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:42:40,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249007199] [2025-03-14 01:42:40,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249007199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:40,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:40,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:40,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760735791] [2025-03-14 01:42:40,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:40,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:40,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:40,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:40,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:40,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 247 [2025-03-14 01:42:40,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:40,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:40,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 247 [2025-03-14 01:42:40,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:40,276 INFO L124 PetriNetUnfolderBase]: 8/179 cut-off events. [2025-03-14 01:42:40,277 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:40,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 179 events. 8/179 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 133. Up to 19 conditions per place. [2025-03-14 01:42:40,278 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 10 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-03-14 01:42:40,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 167 transitions, 366 flow [2025-03-14 01:42:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2025-03-14 01:42:40,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2025-03-14 01:42:40,280 INFO L175 Difference]: Start difference. First operand has 170 places, 168 transitions, 344 flow. Second operand 3 states and 559 transitions. [2025-03-14 01:42:40,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 167 transitions, 366 flow [2025-03-14 01:42:40,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 167 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:40,283 INFO L231 Difference]: Finished difference. Result has 169 places, 167 transitions, 342 flow [2025-03-14 01:42:40,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=169, PETRI_TRANSITIONS=167} [2025-03-14 01:42:40,285 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -47 predicate places. [2025-03-14 01:42:40,285 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 167 transitions, 342 flow [2025-03-14 01:42:40,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:40,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:40,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:40,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:42:40,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:40,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:40,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1655429134, now seen corresponding path program 1 times [2025-03-14 01:42:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:40,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241681986] [2025-03-14 01:42:40,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:40,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:40,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-14 01:42:40,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-14 01:42:40,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:40,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:40,339 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:42:40,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:40,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241681986] [2025-03-14 01:42:40,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241681986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:40,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:40,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:40,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991549997] [2025-03-14 01:42:40,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:40,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:40,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:40,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:40,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:40,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 247 [2025-03-14 01:42:40,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 167 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:40,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:40,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 247 [2025-03-14 01:42:40,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:40,390 INFO L124 PetriNetUnfolderBase]: 8/178 cut-off events. [2025-03-14 01:42:40,390 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:40,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 178 events. 8/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 124. Up to 19 conditions per place. [2025-03-14 01:42:40,391 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 10 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-14 01:42:40,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 166 transitions, 364 flow [2025-03-14 01:42:40,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2025-03-14 01:42:40,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2025-03-14 01:42:40,395 INFO L175 Difference]: Start difference. First operand has 169 places, 167 transitions, 342 flow. Second operand 3 states and 559 transitions. [2025-03-14 01:42:40,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 166 transitions, 364 flow [2025-03-14 01:42:40,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:40,398 INFO L231 Difference]: Finished difference. Result has 168 places, 166 transitions, 340 flow [2025-03-14 01:42:40,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=168, PETRI_TRANSITIONS=166} [2025-03-14 01:42:40,399 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -48 predicate places. [2025-03-14 01:42:40,400 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 166 transitions, 340 flow [2025-03-14 01:42:40,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42:40,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:40,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:40,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:42:40,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:40,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1956660839, now seen corresponding path program 1 times [2025-03-14 01:42:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:40,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695747926] [2025-03-14 01:42:40,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:40,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:40,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-14 01:42:40,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-14 01:42:40,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:40,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:40,456 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:42:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695747926] [2025-03-14 01:42:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695747926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:40,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:40,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:40,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842436750] [2025-03-14 01:42:40,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:40,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:40,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:40,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:40,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 247 [2025-03-14 01:42:40,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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:42:40,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:40,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 247 [2025-03-14 01:42:40,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:40,517 INFO L124 PetriNetUnfolderBase]: 8/177 cut-off events. [2025-03-14 01:42:40,517 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:40,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 177 events. 8/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 118. Up to 22 conditions per place. [2025-03-14 01:42:40,518 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 13 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2025-03-14 01:42:40,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 165 transitions, 368 flow [2025-03-14 01:42:40,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2025-03-14 01:42:40,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7462887989203779 [2025-03-14 01:42:40,519 INFO L175 Difference]: Start difference. First operand has 168 places, 166 transitions, 340 flow. Second operand 3 states and 553 transitions. [2025-03-14 01:42:40,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 165 transitions, 368 flow [2025-03-14 01:42:40,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 165 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:40,521 INFO L231 Difference]: Finished difference. Result has 167 places, 165 transitions, 338 flow [2025-03-14 01:42:40,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=167, PETRI_TRANSITIONS=165} [2025-03-14 01:42:40,522 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -49 predicate places. [2025-03-14 01:42:40,522 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 165 transitions, 338 flow [2025-03-14 01:42:40,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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:42:40,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:40,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:40,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:42:40,523 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:40,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:40,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1999355560, now seen corresponding path program 1 times [2025-03-14 01:42:40,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:40,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60983545] [2025-03-14 01:42:40,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:40,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:42:40,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:42:40,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:40,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:40,569 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:42:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60983545] [2025-03-14 01:42:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60983545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698351847] [2025-03-14 01:42:40,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:40,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:40,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:40,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:40,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 247 [2025-03-14 01:42:40,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 165 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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:42:40,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:40,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 247 [2025-03-14 01:42:40,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:40,630 INFO L124 PetriNetUnfolderBase]: 8/176 cut-off events. [2025-03-14 01:42:40,630 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:40,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 176 events. 8/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 109. Up to 22 conditions per place. [2025-03-14 01:42:40,631 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 13 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-03-14 01:42:40,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 366 flow [2025-03-14 01:42:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2025-03-14 01:42:40,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7462887989203779 [2025-03-14 01:42:40,652 INFO L175 Difference]: Start difference. First operand has 167 places, 165 transitions, 338 flow. Second operand 3 states and 553 transitions. [2025-03-14 01:42:40,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 366 flow [2025-03-14 01:42:40,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:40,654 INFO L231 Difference]: Finished difference. Result has 166 places, 164 transitions, 336 flow [2025-03-14 01:42:40,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=166, PETRI_TRANSITIONS=164} [2025-03-14 01:42:40,656 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -50 predicate places. [2025-03-14 01:42:40,656 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 164 transitions, 336 flow [2025-03-14 01:42:40,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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:42:40,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:40,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:40,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:42:40,657 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:40,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2088822197, now seen corresponding path program 1 times [2025-03-14 01:42:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:40,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502068239] [2025-03-14 01:42:40,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:40,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:40,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-14 01:42:40,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-14 01:42:40,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:40,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:40,724 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:42:40,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:40,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502068239] [2025-03-14 01:42:40,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502068239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:40,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:40,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:40,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768722665] [2025-03-14 01:42:40,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:40,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:40,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:40,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:40,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 247 [2025-03-14 01:42:40,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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:42:40,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:40,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 247 [2025-03-14 01:42:40,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:40,785 INFO L124 PetriNetUnfolderBase]: 8/173 cut-off events. [2025-03-14 01:42:40,785 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:40,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 173 events. 8/173 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 97. Up to 17 conditions per place. [2025-03-14 01:42:40,786 INFO L140 encePairwiseOnDemand]: 243/247 looper letters, 13 selfloop transitions, 1 changer transitions 0/161 dead transitions. [2025-03-14 01:42:40,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 358 flow [2025-03-14 01:42:40,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2025-03-14 01:42:40,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.747638326585695 [2025-03-14 01:42:40,788 INFO L175 Difference]: Start difference. First operand has 166 places, 164 transitions, 336 flow. Second operand 3 states and 554 transitions. [2025-03-14 01:42:40,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 358 flow [2025-03-14 01:42:40,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:40,789 INFO L231 Difference]: Finished difference. Result has 163 places, 161 transitions, 328 flow [2025-03-14 01:42:40,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=163, PETRI_TRANSITIONS=161} [2025-03-14 01:42:40,790 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -53 predicate places. [2025-03-14 01:42:40,790 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 161 transitions, 328 flow [2025-03-14 01:42:40,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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:42:40,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:40,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:40,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:42:40,791 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-14 01:42:40,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash 76881715, now seen corresponding path program 1 times [2025-03-14 01:42:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:40,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401821269] [2025-03-14 01:42:40,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:40,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-14 01:42:40,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-14 01:42:40,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:40,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:40,872 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:42:40,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:40,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401821269] [2025-03-14 01:42:40,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401821269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:40,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:40,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183193744] [2025-03-14 01:42:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:40,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:40,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:40,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:40,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:40,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 247 [2025-03-14 01:42:40,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 161 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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:42:40,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:40,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 247 [2025-03-14 01:42:40,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:40,920 INFO L124 PetriNetUnfolderBase]: 9/195 cut-off events. [2025-03-14 01:42:40,920 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:40,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 195 events. 9/195 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 3 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 154. Up to 17 conditions per place. [2025-03-14 01:42:40,921 INFO L140 encePairwiseOnDemand]: 241/247 looper letters, 0 selfloop transitions, 0 changer transitions 160/160 dead transitions. [2025-03-14 01:42:40,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 160 transitions, 356 flow [2025-03-14 01:42:40,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-03-14 01:42:40,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7489878542510121 [2025-03-14 01:42:40,922 INFO L175 Difference]: Start difference. First operand has 163 places, 161 transitions, 328 flow. Second operand 3 states and 555 transitions. [2025-03-14 01:42:40,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 160 transitions, 356 flow [2025-03-14 01:42:40,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 160 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:40,924 INFO L231 Difference]: Finished difference. Result has 161 places, 0 transitions, 0 flow [2025-03-14 01:42:40,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=161, PETRI_TRANSITIONS=0} [2025-03-14 01:42:40,925 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -55 predicate places. [2025-03-14 01:42:40,925 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 0 transitions, 0 flow [2025-03-14 01:42:40,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (89 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (88 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (87 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (86 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (85 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (84 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (83 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (82 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (81 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (80 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (78 of 90 remaining) [2025-03-14 01:42:40,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (77 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (74 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (73 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (72 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (71 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (70 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (69 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (68 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (67 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (66 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (65 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (64 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (63 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (60 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (58 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (56 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (55 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (53 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (52 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (51 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (50 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (49 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (48 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (47 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (46 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (45 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (44 of 90 remaining) [2025-03-14 01:42:40,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (43 of 90 remaining) [2025-03-14 01:42:40,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 90 remaining) [2025-03-14 01:42:40,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 90 remaining) [2025-03-14 01:42:40,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 90 remaining) [2025-03-14 01:42:40,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (39 of 90 remaining) [2025-03-14 01:42:40,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 90 remaining) [2025-03-14 01:42:40,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 90 remaining) [2025-03-14 01:42:40,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (35 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (34 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (33 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (32 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (31 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (30 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (29 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (28 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (27 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 90 remaining) [2025-03-14 01:42:40,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (8 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (7 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 90 remaining) [2025-03-14 01:42:40,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 90 remaining) [2025-03-14 01:42:40,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:42:40,934 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:40,939 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:42:40,939 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:42:40,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:42:40 BasicIcfg [2025-03-14 01:42:40,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:42:40,945 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:42:40,945 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:42:40,946 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:42:40,946 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:39" (3/4) ... [2025-03-14 01:42:40,947 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:42:40,949 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:42:40,949 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:42:40,953 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-14 01:42:40,953 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:42:40,953 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:42:40,954 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:42:41,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:42:41,018 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:42:41,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:42:41,019 INFO L158 Benchmark]: Toolchain (without parser) took 3318.81ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 104.9MB in the beginning and 162.5MB in the end (delta: -57.5MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2025-03-14 01:42:41,019 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:41,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.49ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 92.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:41,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.34ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.3MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:41,020 INFO L158 Benchmark]: Boogie Preprocessor took 37.48ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:41,020 INFO L158 Benchmark]: IcfgBuilder took 1074.00ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 81.6MB in the end (delta: 6.6MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. [2025-03-14 01:42:41,021 INFO L158 Benchmark]: TraceAbstraction took 1881.17ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 80.9MB in the beginning and 168.0MB in the end (delta: -87.1MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2025-03-14 01:42:41,021 INFO L158 Benchmark]: Witness Printer took 72.50ms. Allocated memory is still 293.6MB. Free memory was 168.0MB in the beginning and 162.5MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:41,022 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.49ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 92.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.34ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.3MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.48ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1074.00ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 81.6MB in the end (delta: 6.6MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1881.17ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 80.9MB in the beginning and 168.0MB in the end (delta: -87.1MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. * Witness Printer took 72.50ms. Allocated memory is still 293.6MB. Free memory was 168.0MB in the beginning and 162.5MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 278 locations, 90 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 294 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 23 mSDtfsCounter, 294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=462occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 860 ConstructedInterpolants, 0 QuantifiedInterpolants, 884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 52 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:42:41,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE