./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:49:02,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:49:02,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:49:02,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:49:02,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:49:02,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:49:02,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:49:02,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:49:02,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:49:02,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:49:02,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:49:02,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:49:02,926 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:49:02,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:49:02,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:49:02,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:49:02,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:49:02,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:49:02,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:49:02,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:49:02,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:49:02,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:49:02,928 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:49:02,928 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:49:02,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:49:02,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:49:02,928 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:49:02,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:49:02,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:49:02,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:49:02,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:49:02,929 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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-03-04 06:49:03,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:49:03,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:49:03,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:49:03,181 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:49:03,181 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:49:03,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 06:49:04,352 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfbd2db7a/eaeaa4dbde5a4da0ba3a1e8198efc077/FLAG82f2af2f7 [2025-03-04 06:49:04,633 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:49:04,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 06:49:04,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfbd2db7a/eaeaa4dbde5a4da0ba3a1e8198efc077/FLAG82f2af2f7 [2025-03-04 06:49:04,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfbd2db7a/eaeaa4dbde5a4da0ba3a1e8198efc077 [2025-03-04 06:49:04,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:49:04,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:49:04,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:49:04,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:49:04,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:49:04,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:49:04" (1/1) ... [2025-03-04 06:49:04,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1298cda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:04, skipping insertion in model container [2025-03-04 06:49:04,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:49:04" (1/1) ... [2025-03-04 06:49:04,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:49:05,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:49:05,152 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:49:05,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:49:05,225 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:49:05,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05 WrapperNode [2025-03-04 06:49:05,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:49:05,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:49:05,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:49:05,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:49:05,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,256 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 171 [2025-03-04 06:49:05,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:49:05,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:49:05,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:49:05,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:49:05,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:49:05,290 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:49:05,290 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:49:05,290 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:49:05,295 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:49:05,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:49:05,324 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-04 06:49:05,329 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-04 06:49:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:49:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-04 06:49:05,342 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-04 06:49:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:49:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:49:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:49:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:49:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:49:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:49:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:49:05,344 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:49:05,435 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:49:05,436 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:49:05,729 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:49:05,729 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:49:05,749 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:49:05,749 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:49:05,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:49:05 BoogieIcfgContainer [2025-03-04 06:49:05,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:49:05,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:49:05,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:49:05,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:49:05,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:49:04" (1/3) ... [2025-03-04 06:49:05,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e43bf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:49:05, skipping insertion in model container [2025-03-04 06:49:05,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05" (2/3) ... [2025-03-04 06:49:05,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e43bf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:49:05, skipping insertion in model container [2025-03-04 06:49:05,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:49:05" (3/3) ... [2025-03-04 06:49:05,759 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 06:49:05,770 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:49:05,773 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 197 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-03-04 06:49:05,773 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:49:05,833 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:49:05,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 206 transitions, 416 flow [2025-03-04 06:49:05,949 INFO L124 PetriNetUnfolderBase]: 10/205 cut-off events. [2025-03-04 06:49:05,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:49:05,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 205 events. 10/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 417 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2025-03-04 06:49:05,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 206 transitions, 416 flow [2025-03-04 06:49:05,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 205 transitions, 413 flow [2025-03-04 06:49:05,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:49:05,987 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;@6b7dccf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:49:05,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 06:49:05,995 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:49:05,998 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-04 06:49:05,998 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:49:05,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:05,999 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] [2025-03-04 06:49:06,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:06,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash -845104352, now seen corresponding path program 1 times [2025-03-04 06:49:06,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:06,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313344437] [2025-03-04 06:49:06,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:06,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:06,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:49:06,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:49:06,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:06,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:06,595 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-04 06:49:06,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:06,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313344437] [2025-03-04 06:49:06,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313344437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:06,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554719151] [2025-03-04 06:49:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:06,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:06,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:06,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:06,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:06,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 206 [2025-03-04 06:49:06,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 205 transitions, 413 flow. Second operand has 6 states, 6 states have (on average 146.33333333333334) internal successors, (878), 6 states have internal predecessors, (878), 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-04 06:49:06,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:06,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 206 [2025-03-04 06:49:06,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:07,172 INFO L124 PetriNetUnfolderBase]: 479/1990 cut-off events. [2025-03-04 06:49:07,173 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:49:07,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 1990 events. 479/1990 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 14193 event pairs, 378 based on Foata normal form. 102/1898 useless extension candidates. Maximal degree in co-relation 2817. Up to 877 conditions per place. [2025-03-04 06:49:07,188 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 47 selfloop transitions, 5 changer transitions 0/192 dead transitions. [2025-03-04 06:49:07,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 192 transitions, 491 flow [2025-03-04 06:49:07,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 929 transitions. [2025-03-04 06:49:07,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7516181229773463 [2025-03-04 06:49:07,200 INFO L175 Difference]: Start difference. First operand has 199 places, 205 transitions, 413 flow. Second operand 6 states and 929 transitions. [2025-03-04 06:49:07,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 192 transitions, 491 flow [2025-03-04 06:49:07,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 192 transitions, 490 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:49:07,208 INFO L231 Difference]: Finished difference. Result has 195 places, 192 transitions, 396 flow [2025-03-04 06:49:07,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=195, PETRI_TRANSITIONS=192} [2025-03-04 06:49:07,213 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, -4 predicate places. [2025-03-04 06:49:07,214 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 192 transitions, 396 flow [2025-03-04 06:49:07,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.33333333333334) internal successors, (878), 6 states have internal predecessors, (878), 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-04 06:49:07,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:07,215 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] [2025-03-04 06:49:07,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:49:07,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:07,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:07,217 INFO L85 PathProgramCache]: Analyzing trace with hash 519213403, now seen corresponding path program 1 times [2025-03-04 06:49:07,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:07,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692815405] [2025-03-04 06:49:07,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:07,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:07,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:49:07,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:49:07,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:07,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:07,547 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-04 06:49:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692815405] [2025-03-04 06:49:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692815405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:07,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:07,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:07,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468551683] [2025-03-04 06:49:07,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:07,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:07,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:07,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:07,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:07,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 206 [2025-03-04 06:49:07,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 192 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 148.16666666666666) internal successors, (889), 6 states have internal predecessors, (889), 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-04 06:49:07,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:07,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 206 [2025-03-04 06:49:07,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:08,220 INFO L124 PetriNetUnfolderBase]: 592/2760 cut-off events. [2025-03-04 06:49:08,220 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:49:08,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3875 conditions, 2760 events. 592/2760 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 21908 event pairs, 78 based on Foata normal form. 0/2530 useless extension candidates. Maximal degree in co-relation 3831. Up to 653 conditions per place. [2025-03-04 06:49:08,237 INFO L140 encePairwiseOnDemand]: 170/206 looper letters, 76 selfloop transitions, 43 changer transitions 0/259 dead transitions. [2025-03-04 06:49:08,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 259 transitions, 768 flow [2025-03-04 06:49:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1000 transitions. [2025-03-04 06:49:08,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8090614886731392 [2025-03-04 06:49:08,240 INFO L175 Difference]: Start difference. First operand has 195 places, 192 transitions, 396 flow. Second operand 6 states and 1000 transitions. [2025-03-04 06:49:08,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 259 transitions, 768 flow [2025-03-04 06:49:08,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 259 transitions, 758 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:49:08,246 INFO L231 Difference]: Finished difference. Result has 200 places, 235 transitions, 716 flow [2025-03-04 06:49:08,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=716, PETRI_PLACES=200, PETRI_TRANSITIONS=235} [2025-03-04 06:49:08,249 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 1 predicate places. [2025-03-04 06:49:08,249 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 235 transitions, 716 flow [2025-03-04 06:49:08,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.16666666666666) internal successors, (889), 6 states have internal predecessors, (889), 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-04 06:49:08,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:08,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:08,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:49:08,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:08,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash 184404595, now seen corresponding path program 1 times [2025-03-04 06:49:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:08,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58011615] [2025-03-04 06:49:08,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:08,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:08,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:49:08,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:49:08,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:08,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:08,533 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-04 06:49:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58011615] [2025-03-04 06:49:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58011615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:08,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:08,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083305795] [2025-03-04 06:49:08,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:08,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:08,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:08,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:08,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:08,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 206 [2025-03-04 06:49:08,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 235 transitions, 716 flow. Second operand has 6 states, 6 states have (on average 166.16666666666666) internal successors, (997), 6 states have internal predecessors, (997), 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-04 06:49:08,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:08,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 206 [2025-03-04 06:49:08,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:09,234 INFO L124 PetriNetUnfolderBase]: 621/3628 cut-off events. [2025-03-04 06:49:09,235 INFO L125 PetriNetUnfolderBase]: For 626/725 co-relation queries the response was YES. [2025-03-04 06:49:09,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6131 conditions, 3628 events. 621/3628 cut-off events. For 626/725 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 29431 event pairs, 81 based on Foata normal form. 20/3444 useless extension candidates. Maximal degree in co-relation 6074. Up to 760 conditions per place. [2025-03-04 06:49:09,253 INFO L140 encePairwiseOnDemand]: 188/206 looper letters, 66 selfloop transitions, 36 changer transitions 0/286 dead transitions. [2025-03-04 06:49:09,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 286 transitions, 1064 flow [2025-03-04 06:49:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1063 transitions. [2025-03-04 06:49:09,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.860032362459547 [2025-03-04 06:49:09,256 INFO L175 Difference]: Start difference. First operand has 200 places, 235 transitions, 716 flow. Second operand 6 states and 1063 transitions. [2025-03-04 06:49:09,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 286 transitions, 1064 flow [2025-03-04 06:49:09,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 286 transitions, 1064 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:49:09,268 INFO L231 Difference]: Finished difference. Result has 210 places, 270 transitions, 1016 flow [2025-03-04 06:49:09,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1016, PETRI_PLACES=210, PETRI_TRANSITIONS=270} [2025-03-04 06:49:09,269 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 11 predicate places. [2025-03-04 06:49:09,269 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 270 transitions, 1016 flow [2025-03-04 06:49:09,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.16666666666666) internal successors, (997), 6 states have internal predecessors, (997), 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-04 06:49:09,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:09,270 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] [2025-03-04 06:49:09,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:49:09,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:09,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2099925940, now seen corresponding path program 1 times [2025-03-04 06:49:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:09,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895996269] [2025-03-04 06:49:09,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:09,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 06:49:09,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 06:49:09,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:09,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:09,538 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-04 06:49:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:09,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895996269] [2025-03-04 06:49:09,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895996269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:09,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:09,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:09,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101426911] [2025-03-04 06:49:09,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:09,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:09,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:09,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:09,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:09,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 206 [2025-03-04 06:49:09,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 270 transitions, 1016 flow. Second operand has 6 states, 6 states have (on average 148.0) internal successors, (888), 6 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:09,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:09,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 206 [2025-03-04 06:49:09,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:10,637 INFO L124 PetriNetUnfolderBase]: 2543/8386 cut-off events. [2025-03-04 06:49:10,637 INFO L125 PetriNetUnfolderBase]: For 4716/5014 co-relation queries the response was YES. [2025-03-04 06:49:10,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19147 conditions, 8386 events. 2543/8386 cut-off events. For 4716/5014 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 71208 event pairs, 840 based on Foata normal form. 115/8034 useless extension candidates. Maximal degree in co-relation 19085. Up to 4332 conditions per place. [2025-03-04 06:49:10,684 INFO L140 encePairwiseOnDemand]: 175/206 looper letters, 129 selfloop transitions, 153 changer transitions 0/426 dead transitions. [2025-03-04 06:49:10,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 426 transitions, 2276 flow [2025-03-04 06:49:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1033 transitions. [2025-03-04 06:49:10,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8357605177993528 [2025-03-04 06:49:10,686 INFO L175 Difference]: Start difference. First operand has 210 places, 270 transitions, 1016 flow. Second operand 6 states and 1033 transitions. [2025-03-04 06:49:10,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 426 transitions, 2276 flow [2025-03-04 06:49:10,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 426 transitions, 2276 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:49:10,711 INFO L231 Difference]: Finished difference. Result has 220 places, 413 transitions, 2406 flow [2025-03-04 06:49:10,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2406, PETRI_PLACES=220, PETRI_TRANSITIONS=413} [2025-03-04 06:49:10,712 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 21 predicate places. [2025-03-04 06:49:10,712 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 413 transitions, 2406 flow [2025-03-04 06:49:10,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.0) internal successors, (888), 6 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:10,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:10,713 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] [2025-03-04 06:49:10,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:49:10,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:10,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:10,714 INFO L85 PathProgramCache]: Analyzing trace with hash 321452497, now seen corresponding path program 1 times [2025-03-04 06:49:10,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:10,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434547571] [2025-03-04 06:49:10,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:10,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:10,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:10,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:10,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:10,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:11,251 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-04 06:49:11,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:11,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434547571] [2025-03-04 06:49:11,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434547571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:11,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:11,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:11,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443696481] [2025-03-04 06:49:11,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:11,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:11,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:11,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:11,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:11,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:11,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 413 transitions, 2406 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:11,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:11,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:11,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:12,727 INFO L124 PetriNetUnfolderBase]: 2167/9605 cut-off events. [2025-03-04 06:49:12,728 INFO L125 PetriNetUnfolderBase]: For 7700/8514 co-relation queries the response was YES. [2025-03-04 06:49:12,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22736 conditions, 9605 events. 2167/9605 cut-off events. For 7700/8514 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 98769 event pairs, 123 based on Foata normal form. 47/9211 useless extension candidates. Maximal degree in co-relation 22671. Up to 2008 conditions per place. [2025-03-04 06:49:12,781 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 46 selfloop transitions, 18 changer transitions 0/456 dead transitions. [2025-03-04 06:49:12,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 456 transitions, 2682 flow [2025-03-04 06:49:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1493 transitions. [2025-03-04 06:49:12,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9059466019417476 [2025-03-04 06:49:12,785 INFO L175 Difference]: Start difference. First operand has 220 places, 413 transitions, 2406 flow. Second operand 8 states and 1493 transitions. [2025-03-04 06:49:12,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 456 transitions, 2682 flow [2025-03-04 06:49:12,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 456 transitions, 2542 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-03-04 06:49:12,826 INFO L231 Difference]: Finished difference. Result has 231 places, 425 transitions, 2387 flow [2025-03-04 06:49:12,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2387, PETRI_PLACES=231, PETRI_TRANSITIONS=425} [2025-03-04 06:49:12,827 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 32 predicate places. [2025-03-04 06:49:12,827 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 425 transitions, 2387 flow [2025-03-04 06:49:12,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:12,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:12,828 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] [2025-03-04 06:49:12,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:49:12,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:12,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1769904683, now seen corresponding path program 2 times [2025-03-04 06:49:12,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:12,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194326744] [2025-03-04 06:49:12,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:49:12,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:12,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:12,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:12,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:49:12,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:13,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:13,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194326744] [2025-03-04 06:49:13,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194326744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:13,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:13,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:13,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428376490] [2025-03-04 06:49:13,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:13,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:13,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:13,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:13,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:13,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:13,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 425 transitions, 2387 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:13,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:13,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:13,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:14,848 INFO L124 PetriNetUnfolderBase]: 2767/11488 cut-off events. [2025-03-04 06:49:14,848 INFO L125 PetriNetUnfolderBase]: For 9925/11052 co-relation queries the response was YES. [2025-03-04 06:49:14,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28705 conditions, 11488 events. 2767/11488 cut-off events. For 9925/11052 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 116429 event pairs, 118 based on Foata normal form. 125/11126 useless extension candidates. Maximal degree in co-relation 28634. Up to 2383 conditions per place. [2025-03-04 06:49:14,939 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 53 selfloop transitions, 22 changer transitions 0/467 dead transitions. [2025-03-04 06:49:14,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 467 transitions, 2765 flow [2025-03-04 06:49:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1488 transitions. [2025-03-04 06:49:14,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029126213592233 [2025-03-04 06:49:14,943 INFO L175 Difference]: Start difference. First operand has 231 places, 425 transitions, 2387 flow. Second operand 8 states and 1488 transitions. [2025-03-04 06:49:14,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 467 transitions, 2765 flow [2025-03-04 06:49:15,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 467 transitions, 2728 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 06:49:15,150 INFO L231 Difference]: Finished difference. Result has 238 places, 434 transitions, 2491 flow [2025-03-04 06:49:15,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2376, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2491, PETRI_PLACES=238, PETRI_TRANSITIONS=434} [2025-03-04 06:49:15,151 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 39 predicate places. [2025-03-04 06:49:15,151 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 434 transitions, 2491 flow [2025-03-04 06:49:15,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:15,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:15,152 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] [2025-03-04 06:49:15,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:49:15,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:15,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:15,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1337738847, now seen corresponding path program 3 times [2025-03-04 06:49:15,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566732871] [2025-03-04 06:49:15,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:49:15,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:15,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:15,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:15,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 06:49:15,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:15,468 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-04 06:49:15,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:15,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566732871] [2025-03-04 06:49:15,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566732871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:15,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:15,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:15,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528520618] [2025-03-04 06:49:15,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:15,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:15,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:15,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:15,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:15,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:15,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 434 transitions, 2491 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:15,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:15,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:15,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:17,458 INFO L124 PetriNetUnfolderBase]: 3503/14695 cut-off events. [2025-03-04 06:49:17,458 INFO L125 PetriNetUnfolderBase]: For 15629/17122 co-relation queries the response was YES. [2025-03-04 06:49:17,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38204 conditions, 14695 events. 3503/14695 cut-off events. For 15629/17122 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 159286 event pairs, 146 based on Foata normal form. 133/14209 useless extension candidates. Maximal degree in co-relation 38130. Up to 3136 conditions per place. [2025-03-04 06:49:17,559 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 72 selfloop transitions, 24 changer transitions 0/488 dead transitions. [2025-03-04 06:49:17,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 488 transitions, 3053 flow [2025-03-04 06:49:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1499 transitions. [2025-03-04 06:49:17,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9095873786407767 [2025-03-04 06:49:17,563 INFO L175 Difference]: Start difference. First operand has 238 places, 434 transitions, 2491 flow. Second operand 8 states and 1499 transitions. [2025-03-04 06:49:17,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 488 transitions, 3053 flow [2025-03-04 06:49:17,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 488 transitions, 2994 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-04 06:49:17,624 INFO L231 Difference]: Finished difference. Result has 247 places, 452 transitions, 2702 flow [2025-03-04 06:49:17,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2466, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2702, PETRI_PLACES=247, PETRI_TRANSITIONS=452} [2025-03-04 06:49:17,627 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 48 predicate places. [2025-03-04 06:49:17,627 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 452 transitions, 2702 flow [2025-03-04 06:49:17,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:17,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:17,628 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] [2025-03-04 06:49:17,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:49:17,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:17,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash 636364175, now seen corresponding path program 4 times [2025-03-04 06:49:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:17,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877224757] [2025-03-04 06:49:17,629 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:49:17,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:17,647 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-03-04 06:49:17,657 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 77 of 85 statements. [2025-03-04 06:49:17,660 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:49:17,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:17,957 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-04 06:49:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:17,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877224757] [2025-03-04 06:49:17,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877224757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:17,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:17,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:17,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421282792] [2025-03-04 06:49:17,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:17,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:17,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:17,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:17,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:18,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:18,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 452 transitions, 2702 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:18,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:18,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:18,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:20,404 INFO L124 PetriNetUnfolderBase]: 4237/17400 cut-off events. [2025-03-04 06:49:20,404 INFO L125 PetriNetUnfolderBase]: For 23240/25298 co-relation queries the response was YES. [2025-03-04 06:49:20,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46278 conditions, 17400 events. 4237/17400 cut-off events. For 23240/25298 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 195319 event pairs, 176 based on Foata normal form. 199/16868 useless extension candidates. Maximal degree in co-relation 46199. Up to 3674 conditions per place. [2025-03-04 06:49:20,501 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 78 selfloop transitions, 43 changer transitions 0/513 dead transitions. [2025-03-04 06:49:20,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 513 transitions, 3446 flow [2025-03-04 06:49:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1494 transitions. [2025-03-04 06:49:20,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9065533980582524 [2025-03-04 06:49:20,506 INFO L175 Difference]: Start difference. First operand has 247 places, 452 transitions, 2702 flow. Second operand 8 states and 1494 transitions. [2025-03-04 06:49:20,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 513 transitions, 3446 flow [2025-03-04 06:49:20,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 513 transitions, 3397 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-03-04 06:49:20,576 INFO L231 Difference]: Finished difference. Result has 257 places, 476 transitions, 3025 flow [2025-03-04 06:49:20,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2663, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3025, PETRI_PLACES=257, PETRI_TRANSITIONS=476} [2025-03-04 06:49:20,580 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 58 predicate places. [2025-03-04 06:49:20,580 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 476 transitions, 3025 flow [2025-03-04 06:49:20,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:20,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:20,581 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] [2025-03-04 06:49:20,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:49:20,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:20,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:20,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1923903407, now seen corresponding path program 5 times [2025-03-04 06:49:20,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:20,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815765748] [2025-03-04 06:49:20,582 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:49:20,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:20,598 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:20,609 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:20,610 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:49:20,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:20,896 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-04 06:49:20,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:20,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815765748] [2025-03-04 06:49:20,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815765748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:20,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:20,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037018256] [2025-03-04 06:49:20,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:20,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:20,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:20,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:21,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:21,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 476 transitions, 3025 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:21,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:21,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:21,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:23,084 INFO L124 PetriNetUnfolderBase]: 4266/17672 cut-off events. [2025-03-04 06:49:23,085 INFO L125 PetriNetUnfolderBase]: For 31382/33677 co-relation queries the response was YES. [2025-03-04 06:49:23,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49401 conditions, 17672 events. 4266/17672 cut-off events. For 31382/33677 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 199314 event pairs, 171 based on Foata normal form. 192/17111 useless extension candidates. Maximal degree in co-relation 49317. Up to 3724 conditions per place. [2025-03-04 06:49:23,402 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 96 selfloop transitions, 34 changer transitions 0/522 dead transitions. [2025-03-04 06:49:23,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 522 transitions, 3741 flow [2025-03-04 06:49:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1501 transitions. [2025-03-04 06:49:23,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9108009708737864 [2025-03-04 06:49:23,405 INFO L175 Difference]: Start difference. First operand has 257 places, 476 transitions, 3025 flow. Second operand 8 states and 1501 transitions. [2025-03-04 06:49:23,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 522 transitions, 3741 flow [2025-03-04 06:49:23,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 522 transitions, 3638 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-03-04 06:49:23,489 INFO L231 Difference]: Finished difference. Result has 264 places, 492 transitions, 3228 flow [2025-03-04 06:49:23,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2940, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3228, PETRI_PLACES=264, PETRI_TRANSITIONS=492} [2025-03-04 06:49:23,489 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 65 predicate places. [2025-03-04 06:49:23,490 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 492 transitions, 3228 flow [2025-03-04 06:49:23,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:23,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:23,490 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] [2025-03-04 06:49:23,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:49:23,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:23,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:23,491 INFO L85 PathProgramCache]: Analyzing trace with hash -947122707, now seen corresponding path program 6 times [2025-03-04 06:49:23,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:23,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016692475] [2025-03-04 06:49:23,491 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 06:49:23,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:23,504 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:23,513 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:23,513 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 06:49:23,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:23,818 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-04 06:49:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016692475] [2025-03-04 06:49:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016692475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:23,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135816471] [2025-03-04 06:49:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:23,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:23,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:23,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:23,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:24,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:24,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 492 transitions, 3228 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:24,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:24,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:24,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:26,190 INFO L124 PetriNetUnfolderBase]: 4266/17667 cut-off events. [2025-03-04 06:49:26,190 INFO L125 PetriNetUnfolderBase]: For 35990/38340 co-relation queries the response was YES. [2025-03-04 06:49:26,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49746 conditions, 17667 events. 4266/17667 cut-off events. For 35990/38340 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 199315 event pairs, 180 based on Foata normal form. 317/17235 useless extension candidates. Maximal degree in co-relation 49659. Up to 3699 conditions per place. [2025-03-04 06:49:26,327 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 103 selfloop transitions, 43 changer transitions 0/538 dead transitions. [2025-03-04 06:49:26,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 538 transitions, 3989 flow [2025-03-04 06:49:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1495 transitions. [2025-03-04 06:49:26,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9071601941747572 [2025-03-04 06:49:26,332 INFO L175 Difference]: Start difference. First operand has 264 places, 492 transitions, 3228 flow. Second operand 8 states and 1495 transitions. [2025-03-04 06:49:26,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 538 transitions, 3989 flow [2025-03-04 06:49:26,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 538 transitions, 3932 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-04 06:49:26,422 INFO L231 Difference]: Finished difference. Result has 271 places, 504 transitions, 3488 flow [2025-03-04 06:49:26,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3181, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3488, PETRI_PLACES=271, PETRI_TRANSITIONS=504} [2025-03-04 06:49:26,423 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 72 predicate places. [2025-03-04 06:49:26,423 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 504 transitions, 3488 flow [2025-03-04 06:49:26,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:26,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:26,423 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] [2025-03-04 06:49:26,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:49:26,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:26,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:26,424 INFO L85 PathProgramCache]: Analyzing trace with hash 395257431, now seen corresponding path program 7 times [2025-03-04 06:49:26,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:26,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365062382] [2025-03-04 06:49:26,424 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 06:49:26,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:26,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:26,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:26,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:26,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:26,722 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-04 06:49:26,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:26,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365062382] [2025-03-04 06:49:26,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365062382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:26,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:26,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:26,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197163923] [2025-03-04 06:49:26,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:26,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:26,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:26,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:26,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:27,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:27,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 504 transitions, 3488 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:27,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:27,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:27,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:28,636 INFO L124 PetriNetUnfolderBase]: 3565/15312 cut-off events. [2025-03-04 06:49:28,636 INFO L125 PetriNetUnfolderBase]: For 38351/40411 co-relation queries the response was YES. [2025-03-04 06:49:28,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43900 conditions, 15312 events. 3565/15312 cut-off events. For 38351/40411 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 167685 event pairs, 148 based on Foata normal form. 214/14880 useless extension candidates. Maximal degree in co-relation 43809. Up to 3195 conditions per place. [2025-03-04 06:49:28,776 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 100 selfloop transitions, 46 changer transitions 0/538 dead transitions. [2025-03-04 06:49:28,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 538 transitions, 4191 flow [2025-03-04 06:49:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1497 transitions. [2025-03-04 06:49:28,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908373786407767 [2025-03-04 06:49:28,778 INFO L175 Difference]: Start difference. First operand has 271 places, 504 transitions, 3488 flow. Second operand 8 states and 1497 transitions. [2025-03-04 06:49:28,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 538 transitions, 4191 flow [2025-03-04 06:49:28,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 538 transitions, 4111 flow, removed 29 selfloop flow, removed 3 redundant places. [2025-03-04 06:49:28,876 INFO L231 Difference]: Finished difference. Result has 278 places, 517 transitions, 3766 flow [2025-03-04 06:49:28,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3385, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3766, PETRI_PLACES=278, PETRI_TRANSITIONS=517} [2025-03-04 06:49:28,877 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 79 predicate places. [2025-03-04 06:49:28,877 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 517 transitions, 3766 flow [2025-03-04 06:49:28,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:28,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:28,877 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] [2025-03-04 06:49:28,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:49:28,878 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:28,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:28,878 INFO L85 PathProgramCache]: Analyzing trace with hash -384655301, now seen corresponding path program 8 times [2025-03-04 06:49:28,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:28,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-03-04 06:49:28,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:49:28,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:28,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:28,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:28,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:49:28,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:29,114 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-04 06:49:29,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:29,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-03-04 06:49:29,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295655933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:29,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577863901] [2025-03-04 06:49:29,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:29,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:29,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:29,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:29,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:29,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 517 transitions, 3766 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:29,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:29,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:29,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:31,544 INFO L124 PetriNetUnfolderBase]: 3612/15611 cut-off events. [2025-03-04 06:49:31,544 INFO L125 PetriNetUnfolderBase]: For 39766/41752 co-relation queries the response was YES. [2025-03-04 06:49:31,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44925 conditions, 15611 events. 3612/15611 cut-off events. For 39766/41752 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 172197 event pairs, 131 based on Foata normal form. 332/15271 useless extension candidates. Maximal degree in co-relation 44831. Up to 3292 conditions per place. [2025-03-04 06:49:31,649 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 124 selfloop transitions, 43 changer transitions 0/559 dead transitions. [2025-03-04 06:49:31,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 559 transitions, 4603 flow [2025-03-04 06:49:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1496 transitions. [2025-03-04 06:49:31,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9077669902912622 [2025-03-04 06:49:31,652 INFO L175 Difference]: Start difference. First operand has 278 places, 517 transitions, 3766 flow. Second operand 8 states and 1496 transitions. [2025-03-04 06:49:31,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 559 transitions, 4603 flow [2025-03-04 06:49:31,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 559 transitions, 4504 flow, removed 23 selfloop flow, removed 4 redundant places. [2025-03-04 06:49:31,744 INFO L231 Difference]: Finished difference. Result has 286 places, 532 transitions, 4026 flow [2025-03-04 06:49:31,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3671, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4026, PETRI_PLACES=286, PETRI_TRANSITIONS=532} [2025-03-04 06:49:31,744 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 87 predicate places. [2025-03-04 06:49:31,744 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 532 transitions, 4026 flow [2025-03-04 06:49:31,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:31,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:31,745 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] [2025-03-04 06:49:31,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:49:31,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:31,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash -157834603, now seen corresponding path program 9 times [2025-03-04 06:49:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974581313] [2025-03-04 06:49:31,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:49:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:31,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:31,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:31,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 06:49:31,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:31,948 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-04 06:49:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974581313] [2025-03-04 06:49:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974581313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:31,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:31,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:31,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369552656] [2025-03-04 06:49:31,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:31,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:31,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:31,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:31,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:32,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:32,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 532 transitions, 4026 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:32,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:32,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:32,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:33,955 INFO L124 PetriNetUnfolderBase]: 3682/15766 cut-off events. [2025-03-04 06:49:33,955 INFO L125 PetriNetUnfolderBase]: For 47434/49767 co-relation queries the response was YES. [2025-03-04 06:49:34,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46407 conditions, 15766 events. 3682/15766 cut-off events. For 47434/49767 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 171457 event pairs, 134 based on Foata normal form. 505/15577 useless extension candidates. Maximal degree in co-relation 46308. Up to 3297 conditions per place. [2025-03-04 06:49:34,158 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 99 selfloop transitions, 81 changer transitions 0/572 dead transitions. [2025-03-04 06:49:34,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 572 transitions, 5004 flow [2025-03-04 06:49:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1488 transitions. [2025-03-04 06:49:34,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029126213592233 [2025-03-04 06:49:34,161 INFO L175 Difference]: Start difference. First operand has 286 places, 532 transitions, 4026 flow. Second operand 8 states and 1488 transitions. [2025-03-04 06:49:34,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 572 transitions, 5004 flow [2025-03-04 06:49:34,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 572 transitions, 4903 flow, removed 43 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:34,291 INFO L231 Difference]: Finished difference. Result has 294 places, 540 transitions, 4282 flow [2025-03-04 06:49:34,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3926, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4282, PETRI_PLACES=294, PETRI_TRANSITIONS=540} [2025-03-04 06:49:34,292 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 95 predicate places. [2025-03-04 06:49:34,292 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 540 transitions, 4282 flow [2025-03-04 06:49:34,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:34,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:34,293 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] [2025-03-04 06:49:34,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:49:34,293 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:34,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:34,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1505111095, now seen corresponding path program 10 times [2025-03-04 06:49:34,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:34,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254277477] [2025-03-04 06:49:34,294 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:49:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:34,302 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-03-04 06:49:34,305 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 77 of 85 statements. [2025-03-04 06:49:34,305 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:49:34,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:34,472 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-04 06:49:34,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:34,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254277477] [2025-03-04 06:49:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254277477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:34,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623750223] [2025-03-04 06:49:34,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:34,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:34,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:34,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:34,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:34,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 540 transitions, 4282 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:34,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:34,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:34,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:36,312 INFO L124 PetriNetUnfolderBase]: 3113/14045 cut-off events. [2025-03-04 06:49:36,312 INFO L125 PetriNetUnfolderBase]: For 47581/49825 co-relation queries the response was YES. [2025-03-04 06:49:36,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41973 conditions, 14045 events. 3113/14045 cut-off events. For 47581/49825 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 149404 event pairs, 118 based on Foata normal form. 332/13761 useless extension candidates. Maximal degree in co-relation 41871. Up to 2878 conditions per place. [2025-03-04 06:49:36,466 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 121 selfloop transitions, 62 changer transitions 0/575 dead transitions. [2025-03-04 06:49:36,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 575 transitions, 5146 flow [2025-03-04 06:49:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1493 transitions. [2025-03-04 06:49:36,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9059466019417476 [2025-03-04 06:49:36,468 INFO L175 Difference]: Start difference. First operand has 294 places, 540 transitions, 4282 flow. Second operand 8 states and 1493 transitions. [2025-03-04 06:49:36,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 575 transitions, 5146 flow [2025-03-04 06:49:36,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 575 transitions, 5001 flow, removed 46 selfloop flow, removed 3 redundant places. [2025-03-04 06:49:36,594 INFO L231 Difference]: Finished difference. Result has 301 places, 553 transitions, 4521 flow [2025-03-04 06:49:36,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=4103, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4521, PETRI_PLACES=301, PETRI_TRANSITIONS=553} [2025-03-04 06:49:36,595 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 102 predicate places. [2025-03-04 06:49:36,595 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 553 transitions, 4521 flow [2025-03-04 06:49:36,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:36,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:36,596 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] [2025-03-04 06:49:36,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:49:36,596 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:36,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1138146027, now seen corresponding path program 11 times [2025-03-04 06:49:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:36,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827685557] [2025-03-04 06:49:36,597 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:49:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:36,604 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:36,609 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:36,609 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:49:36,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:36,785 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-04 06:49:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:36,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827685557] [2025-03-04 06:49:36,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827685557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:36,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:36,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029416346] [2025-03-04 06:49:36,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:36,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:36,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:36,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:36,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:37,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:37,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 553 transitions, 4521 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:37,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:37,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:37,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:38,976 INFO L124 PetriNetUnfolderBase]: 3113/14010 cut-off events. [2025-03-04 06:49:38,976 INFO L125 PetriNetUnfolderBase]: For 54885/57282 co-relation queries the response was YES. [2025-03-04 06:49:39,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42579 conditions, 14010 events. 3113/14010 cut-off events. For 54885/57282 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 148898 event pairs, 109 based on Foata normal form. 308/13709 useless extension candidates. Maximal degree in co-relation 42474. Up to 2853 conditions per place. [2025-03-04 06:49:39,097 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 162 selfloop transitions, 33 changer transitions 0/587 dead transitions. [2025-03-04 06:49:39,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 587 transitions, 5388 flow [2025-03-04 06:49:39,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1499 transitions. [2025-03-04 06:49:39,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9095873786407767 [2025-03-04 06:49:39,100 INFO L175 Difference]: Start difference. First operand has 301 places, 553 transitions, 4521 flow. Second operand 8 states and 1499 transitions. [2025-03-04 06:49:39,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 587 transitions, 5388 flow [2025-03-04 06:49:39,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 587 transitions, 5291 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-03-04 06:49:39,217 INFO L231 Difference]: Finished difference. Result has 309 places, 563 transitions, 4701 flow [2025-03-04 06:49:39,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=4436, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4701, PETRI_PLACES=309, PETRI_TRANSITIONS=563} [2025-03-04 06:49:39,218 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 110 predicate places. [2025-03-04 06:49:39,218 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 563 transitions, 4701 flow [2025-03-04 06:49:39,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:39,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:39,219 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] [2025-03-04 06:49:39,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:49:39,219 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:39,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:39,220 INFO L85 PathProgramCache]: Analyzing trace with hash -856269277, now seen corresponding path program 12 times [2025-03-04 06:49:39,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:39,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924326907] [2025-03-04 06:49:39,220 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 06:49:39,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:39,227 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:39,230 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:39,231 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 06:49:39,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924326907] [2025-03-04 06:49:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924326907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:39,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:39,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959757282] [2025-03-04 06:49:39,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:39,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:39,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:39,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:39,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:39,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 563 transitions, 4701 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:39,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:39,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:39,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:41,583 INFO L124 PetriNetUnfolderBase]: 3143/14377 cut-off events. [2025-03-04 06:49:41,583 INFO L125 PetriNetUnfolderBase]: For 54990/57396 co-relation queries the response was YES. [2025-03-04 06:49:41,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43665 conditions, 14377 events. 3143/14377 cut-off events. For 54990/57396 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 153917 event pairs, 116 based on Foata normal form. 282/14032 useless extension candidates. Maximal degree in co-relation 43556. Up to 2928 conditions per place. [2025-03-04 06:49:41,776 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 157 selfloop transitions, 48 changer transitions 0/597 dead transitions. [2025-03-04 06:49:41,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 597 transitions, 5667 flow [2025-03-04 06:49:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1498 transitions. [2025-03-04 06:49:41,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9089805825242718 [2025-03-04 06:49:41,778 INFO L175 Difference]: Start difference. First operand has 309 places, 563 transitions, 4701 flow. Second operand 8 states and 1498 transitions. [2025-03-04 06:49:41,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 597 transitions, 5667 flow [2025-03-04 06:49:41,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 597 transitions, 5503 flow, removed 66 selfloop flow, removed 3 redundant places. [2025-03-04 06:49:41,946 INFO L231 Difference]: Finished difference. Result has 316 places, 579 transitions, 5027 flow [2025-03-04 06:49:41,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=4619, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5027, PETRI_PLACES=316, PETRI_TRANSITIONS=579} [2025-03-04 06:49:41,947 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 117 predicate places. [2025-03-04 06:49:41,947 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 579 transitions, 5027 flow [2025-03-04 06:49:41,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:41,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:41,947 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] [2025-03-04 06:49:41,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:49:41,947 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:41,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1512960497, now seen corresponding path program 13 times [2025-03-04 06:49:41,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:41,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236317137] [2025-03-04 06:49:41,948 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 06:49:41,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:41,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:41,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:41,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:41,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:42,131 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-04 06:49:42,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:42,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236317137] [2025-03-04 06:49:42,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236317137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:42,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:42,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:42,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608661655] [2025-03-04 06:49:42,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:42,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:42,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:42,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:42,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:42,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:42,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 579 transitions, 5027 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:42,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:42,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:42,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:44,499 INFO L124 PetriNetUnfolderBase]: 2487/12117 cut-off events. [2025-03-04 06:49:44,499 INFO L125 PetriNetUnfolderBase]: For 43893/45773 co-relation queries the response was YES. [2025-03-04 06:49:44,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36147 conditions, 12117 events. 2487/12117 cut-off events. For 43893/45773 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 126243 event pairs, 95 based on Foata normal form. 228/11798 useless extension candidates. Maximal degree in co-relation 36035. Up to 2447 conditions per place. [2025-03-04 06:49:44,675 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 161 selfloop transitions, 50 changer transitions 0/603 dead transitions. [2025-03-04 06:49:44,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 603 transitions, 5825 flow [2025-03-04 06:49:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1501 transitions. [2025-03-04 06:49:44,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9108009708737864 [2025-03-04 06:49:44,680 INFO L175 Difference]: Start difference. First operand has 316 places, 579 transitions, 5027 flow. Second operand 8 states and 1501 transitions. [2025-03-04 06:49:44,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 603 transitions, 5825 flow [2025-03-04 06:49:44,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 603 transitions, 5700 flow, removed 33 selfloop flow, removed 4 redundant places. [2025-03-04 06:49:44,839 INFO L231 Difference]: Finished difference. Result has 322 places, 592 transitions, 5304 flow [2025-03-04 06:49:44,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=4863, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5304, PETRI_PLACES=322, PETRI_TRANSITIONS=592} [2025-03-04 06:49:44,839 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 123 predicate places. [2025-03-04 06:49:44,839 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 592 transitions, 5304 flow [2025-03-04 06:49:44,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:44,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:44,841 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] [2025-03-04 06:49:44,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:49:44,841 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:44,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:44,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1471499345, now seen corresponding path program 14 times [2025-03-04 06:49:44,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:44,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474689052] [2025-03-04 06:49:44,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:49:44,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:44,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:49:44,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:49:44,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:49:44,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:45,089 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-04 06:49:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:45,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474689052] [2025-03-04 06:49:45,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474689052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:45,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:49:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343388997] [2025-03-04 06:49:45,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:45,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:49:45,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:45,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:49:45,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:49:45,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-03-04 06:49:45,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 592 transitions, 5304 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:45,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:45,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-03-04 06:49:45,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:46,032 INFO L124 PetriNetUnfolderBase]: 370/3904 cut-off events. [2025-03-04 06:49:46,032 INFO L125 PetriNetUnfolderBase]: For 16418/16666 co-relation queries the response was YES. [2025-03-04 06:49:46,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11099 conditions, 3904 events. 370/3904 cut-off events. For 16418/16666 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 36338 event pairs, 15 based on Foata normal form. 76/3802 useless extension candidates. Maximal degree in co-relation 10984. Up to 738 conditions per place. [2025-03-04 06:49:46,073 INFO L140 encePairwiseOnDemand]: 195/206 looper letters, 118 selfloop transitions, 82 changer transitions 0/373 dead transitions. [2025-03-04 06:49:46,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 373 transitions, 4028 flow [2025-03-04 06:49:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1491 transitions. [2025-03-04 06:49:46,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047330097087378 [2025-03-04 06:49:46,074 INFO L175 Difference]: Start difference. First operand has 322 places, 592 transitions, 5304 flow. Second operand 8 states and 1491 transitions. [2025-03-04 06:49:46,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 373 transitions, 4028 flow [2025-03-04 06:49:46,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 373 transitions, 3529 flow, removed 124 selfloop flow, removed 18 redundant places. [2025-03-04 06:49:46,127 INFO L231 Difference]: Finished difference. Result has 306 places, 369 transitions, 3318 flow [2025-03-04 06:49:46,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3034, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3318, PETRI_PLACES=306, PETRI_TRANSITIONS=369} [2025-03-04 06:49:46,128 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 107 predicate places. [2025-03-04 06:49:46,128 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 369 transitions, 3318 flow [2025-03-04 06:49:46,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04 06:49:46,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:46,129 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] [2025-03-04 06:49:46,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:49:46,129 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:46,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:46,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1821631149, now seen corresponding path program 1 times [2025-03-04 06:49:46,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:46,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339100865] [2025-03-04 06:49:46,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:46,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:46,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 06:49:46,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 06:49:46,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:46,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:46,271 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-04 06:49:46,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:46,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339100865] [2025-03-04 06:49:46,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339100865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:46,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:46,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:49:46,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627024044] [2025-03-04 06:49:46,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:46,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:49:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:46,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:49:46,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:49:46,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2025-03-04 06:49:46,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 369 transitions, 3318 flow. Second operand has 9 states, 9 states have (on average 175.0) internal successors, (1575), 9 states have internal predecessors, (1575), 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-04 06:49:46,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:46,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2025-03-04 06:49:46,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:47,148 INFO L124 PetriNetUnfolderBase]: 417/4634 cut-off events. [2025-03-04 06:49:47,148 INFO L125 PetriNetUnfolderBase]: For 15748/15915 co-relation queries the response was YES. [2025-03-04 06:49:47,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10725 conditions, 4634 events. 417/4634 cut-off events. For 15748/15915 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 41210 event pairs, 11 based on Foata normal form. 124/4576 useless extension candidates. Maximal degree in co-relation 10607. Up to 567 conditions per place. [2025-03-04 06:49:47,191 INFO L140 encePairwiseOnDemand]: 195/206 looper letters, 167 selfloop transitions, 24 changer transitions 0/424 dead transitions. [2025-03-04 06:49:47,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 424 transitions, 4460 flow [2025-03-04 06:49:47,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:49:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 06:49:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1425 transitions. [2025-03-04 06:49:47,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8646844660194175 [2025-03-04 06:49:47,193 INFO L175 Difference]: Start difference. First operand has 306 places, 369 transitions, 3318 flow. Second operand 8 states and 1425 transitions. [2025-03-04 06:49:47,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 424 transitions, 4460 flow [2025-03-04 06:49:47,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 424 transitions, 4190 flow, removed 45 selfloop flow, removed 6 redundant places. [2025-03-04 06:49:47,233 INFO L231 Difference]: Finished difference. Result has 311 places, 388 transitions, 3466 flow [2025-03-04 06:49:47,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3094, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3466, PETRI_PLACES=311, PETRI_TRANSITIONS=388} [2025-03-04 06:49:47,234 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 112 predicate places. [2025-03-04 06:49:47,234 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 388 transitions, 3466 flow [2025-03-04 06:49:47,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 175.0) internal successors, (1575), 9 states have internal predecessors, (1575), 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-04 06:49:47,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:47,235 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] [2025-03-04 06:49:47,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:49:47,235 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:49:47,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:47,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1754824586, now seen corresponding path program 1 times [2025-03-04 06:49:47,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:47,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370190099] [2025-03-04 06:49:47,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:47,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:47,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 06:49:47,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 06:49:47,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:47,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:49:47,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:47,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370190099] [2025-03-04 06:49:47,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370190099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:47,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:47,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:47,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794924093] [2025-03-04 06:49:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:47,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:47,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:47,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:47,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:47,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 206 [2025-03-04 06:49:47,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 388 transitions, 3466 flow. Second operand has 6 states, 6 states have (on average 148.0) internal successors, (888), 6 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:47,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:47,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 206 [2025-03-04 06:49:47,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:48,153 INFO L124 PetriNetUnfolderBase]: 706/5108 cut-off events. [2025-03-04 06:49:48,153 INFO L125 PetriNetUnfolderBase]: For 26474/27076 co-relation queries the response was YES. [2025-03-04 06:49:48,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14576 conditions, 5108 events. 706/5108 cut-off events. For 26474/27076 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 44512 event pairs, 158 based on Foata normal form. 559/5502 useless extension candidates. Maximal degree in co-relation 14453. Up to 2313 conditions per place. [2025-03-04 06:49:48,198 INFO L140 encePairwiseOnDemand]: 200/206 looper letters, 0 selfloop transitions, 0 changer transitions 387/387 dead transitions. [2025-03-04 06:49:48,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 387 transitions, 3812 flow [2025-03-04 06:49:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 898 transitions. [2025-03-04 06:49:48,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7265372168284789 [2025-03-04 06:49:48,199 INFO L175 Difference]: Start difference. First operand has 311 places, 388 transitions, 3466 flow. Second operand 6 states and 898 transitions. [2025-03-04 06:49:48,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 387 transitions, 3812 flow [2025-03-04 06:49:48,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 387 transitions, 3806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:48,239 INFO L231 Difference]: Finished difference. Result has 313 places, 0 transitions, 0 flow [2025-03-04 06:49:48,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3458, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=313, PETRI_TRANSITIONS=0} [2025-03-04 06:49:48,240 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 114 predicate places. [2025-03-04 06:49:48,240 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 0 transitions, 0 flow [2025-03-04 06:49:48,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.0) internal successors, (888), 6 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:48,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr5ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr3ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr4ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr5ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr3ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr4ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-03-04 06:49:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-03-04 06:49:48,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:49:48,243 INFO L422 BasicCegarLoop]: Path program histogram: [14, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:48,247 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:49:48,247 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:49:48,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:49:48 BasicIcfg [2025-03-04 06:49:48,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:49:48,250 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:49:48,250 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:49:48,251 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:49:48,251 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:49:05" (3/4) ... [2025-03-04 06:49:48,252 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:49:48,254 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure worker [2025-03-04 06:49:48,256 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 06:49:48,256 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:49:48,256 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:49:48,256 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:49:48,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:49:48,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:49:48,306 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:49:48,307 INFO L158 Benchmark]: Toolchain (without parser) took 43388.47ms. Allocated memory was 142.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 104.6MB in the beginning and 1.1GB in the end (delta: -988.7MB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2025-03-04 06:49:48,307 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:49:48,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.97ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 84.5MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:49:48,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.92ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:49:48,307 INFO L158 Benchmark]: Boogie Preprocessor took 31.79ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 79.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:49:48,308 INFO L158 Benchmark]: IcfgBuilder took 459.59ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 56.0MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:49:48,308 INFO L158 Benchmark]: TraceAbstraction took 42498.56ms. Allocated memory was 142.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 55.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2025-03-04 06:49:48,308 INFO L158 Benchmark]: Witness Printer took 55.85ms. Allocated memory is still 4.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:49:48,309 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.33ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.97ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 84.5MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.92ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.79ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 79.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 459.59ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 56.0MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42498.56ms. Allocated memory was 142.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 55.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Witness Printer took 55.85ms. Allocated memory is still 4.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 714]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 715]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 715]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 723]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 726]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 727]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 728]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 728]: 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 3 procedures, 297 locations, 17 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: 42.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 36.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9671 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7458 mSDsluCounter, 10030 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9060 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19242 IncrementalHoareTripleChecker+Invalid, 19530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 970 mSDtfsCounter, 19242 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5304occurred in iteration=17, InterpolantAutomatonStates: 150, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1633 NumberOfCodeBlocks, 1617 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1613 ConstructedInterpolants, 0 QuantifiedInterpolants, 6025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 3/3 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:49:48,324 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