./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:43:19,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:43:19,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:43:19,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:43:19,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:43:19,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:43:19,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:43:19,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:43:19,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:43:19,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:43:19,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:43:19,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:43:19,355 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:43:19,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:43:19,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:43:19,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:43:19,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:43:19,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:43:19,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:43:19,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:43:19,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:43:19,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:43:19,356 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:43:19,356 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:43:19,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:43:19,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:43:19,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:43:19,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:43:19,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:43:19,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:43:19,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:43:19,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:43:19,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:43:19,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:43:19,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:43:19,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:43:19,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:43:19,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:43:19,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:43:19,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:43:19,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:43:19,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:43:19,357 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 -> 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 [2025-03-14 01:43:19,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:43:19,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:43:19,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:43:19,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:43:19,580 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:43:19,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2025-03-14 01:43:20,743 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07ab8178/a86623cae25d46959bbd1fdf478a9f20/FLAGb8bc309cd [2025-03-14 01:43:20,947 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:43:20,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2025-03-14 01:43:20,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07ab8178/a86623cae25d46959bbd1fdf478a9f20/FLAGb8bc309cd [2025-03-14 01:43:20,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07ab8178/a86623cae25d46959bbd1fdf478a9f20 [2025-03-14 01:43:20,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:43:20,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:43:20,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:43:20,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:43:20,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:43:20,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:43:20" (1/1) ... [2025-03-14 01:43:20,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3641e6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:20, skipping insertion in model container [2025-03-14 01:43:20,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:43:20" (1/1) ... [2025-03-14 01:43:20,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:43:21,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:43:21,105 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:43:21,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:43:21,131 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:43:21,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21 WrapperNode [2025-03-14 01:43:21,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:43:21,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:43:21,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:43:21,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:43:21,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (1/1) ... [2025-03-14 01:43:21,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (1/1) ... [2025-03-14 01:43:21,162 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 239 [2025-03-14 01:43:21,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:43:21,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:43:21,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:43:21,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:43:21,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (1/1) ... [2025-03-14 01:43:21,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (1/1) ... [2025-03-14 01:43:21,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (1/1) ... [2025-03-14 01:43:21,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (1/1) ... [2025-03-14 01:43:21,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (1/1) ... [2025-03-14 01:43:21,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (1/1) ... [2025-03-14 01:43:21,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (1/1) ... [2025-03-14 01:43:21,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (1/1) ... [2025-03-14 01:43:21,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:43:21,180 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:43:21,180 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:43:21,180 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:43:21,181 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (1/1) ... [2025-03-14 01:43:21,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:43:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:43:21,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:43:21,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:43:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:43:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:43:21,226 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:43:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:43:21,226 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:43:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:43:21,226 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:43:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:43:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:43:21,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:43:21,227 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:43:21,313 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:43:21,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:43:21,611 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:43:21,612 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:43:21,612 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:43:21,625 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:43:21,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:43:21 BoogieIcfgContainer [2025-03-14 01:43:21,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:43:21,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:43:21,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:43:21,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:43:21,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:43:20" (1/3) ... [2025-03-14 01:43:21,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6688507d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:43:21, skipping insertion in model container [2025-03-14 01:43:21,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:21" (2/3) ... [2025-03-14 01:43:21,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6688507d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:43:21, skipping insertion in model container [2025-03-14 01:43:21,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:43:21" (3/3) ... [2025-03-14 01:43:21,632 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2025-03-14 01:43:21,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:43:21,644 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-subst.wvr.c that has 4 procedures, 311 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-14 01:43:21,644 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:43:21,732 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:43:21,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 325 transitions, 671 flow [2025-03-14 01:43:21,853 INFO L124 PetriNetUnfolderBase]: 15/322 cut-off events. [2025-03-14 01:43:21,874 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:43:21,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 322 events. 15/322 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2025-03-14 01:43:21,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 325 transitions, 671 flow [2025-03-14 01:43:21,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 302 transitions, 622 flow [2025-03-14 01:43:21,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:43:21,913 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;@7db98b13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:43:21,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-14 01:43:21,922 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:43:21,923 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-14 01:43:21,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:43:21,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:21,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:21,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:21,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:21,928 INFO L85 PathProgramCache]: Analyzing trace with hash -565800361, now seen corresponding path program 1 times [2025-03-14 01:43:21,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304474353] [2025-03-14 01:43:21,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:21,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:43:22,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:43:22,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:22,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:22,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304474353] [2025-03-14 01:43:22,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304474353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:22,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:22,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:22,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115564331] [2025-03-14 01:43:22,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:22,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:22,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:22,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:22,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:22,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2025-03-14 01:43:22,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:22,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:22,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2025-03-14 01:43:22,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:22,249 INFO L124 PetriNetUnfolderBase]: 25/649 cut-off events. [2025-03-14 01:43:22,249 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-14 01:43:22,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 649 events. 25/649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3293 event pairs, 7 based on Foata normal form. 22/566 useless extension candidates. Maximal degree in co-relation 514. Up to 25 conditions per place. [2025-03-14 01:43:22,260 INFO L140 encePairwiseOnDemand]: 315/325 looper letters, 11 selfloop transitions, 2 changer transitions 1/294 dead transitions. [2025-03-14 01:43:22,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 294 transitions, 632 flow [2025-03-14 01:43:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-03-14 01:43:22,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-03-14 01:43:22,280 INFO L175 Difference]: Start difference. First operand has 299 places, 302 transitions, 622 flow. Second operand 3 states and 924 transitions. [2025-03-14 01:43:22,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 294 transitions, 632 flow [2025-03-14 01:43:22,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 294 transitions, 620 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:43:22,293 INFO L231 Difference]: Finished difference. Result has 294 places, 293 transitions, 596 flow [2025-03-14 01:43:22,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=294, PETRI_TRANSITIONS=293} [2025-03-14 01:43:22,298 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -5 predicate places. [2025-03-14 01:43:22,299 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 293 transitions, 596 flow [2025-03-14 01:43:22,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:22,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:22,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:22,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:43:22,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:22,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash 799933836, now seen corresponding path program 1 times [2025-03-14 01:43:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385801797] [2025-03-14 01:43:22,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:22,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:43:22,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:43:22,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:22,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:22,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:22,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385801797] [2025-03-14 01:43:22,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385801797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:22,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:22,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:22,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569761416] [2025-03-14 01:43:22,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:22,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:22,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:22,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:22,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:22,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2025-03-14 01:43:22,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 293 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:22,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:22,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2025-03-14 01:43:22,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:22,447 INFO L124 PetriNetUnfolderBase]: 21/551 cut-off events. [2025-03-14 01:43:22,447 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-03-14 01:43:22,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 551 events. 21/551 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2544 event pairs, 7 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 555. Up to 25 conditions per place. [2025-03-14 01:43:22,453 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-03-14 01:43:22,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 620 flow [2025-03-14 01:43:22,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2025-03-14 01:43:22,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2025-03-14 01:43:22,455 INFO L175 Difference]: Start difference. First operand has 294 places, 293 transitions, 596 flow. Second operand 3 states and 917 transitions. [2025-03-14 01:43:22,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 620 flow [2025-03-14 01:43:22,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 292 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:22,460 INFO L231 Difference]: Finished difference. Result has 292 places, 292 transitions, 594 flow [2025-03-14 01:43:22,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=292, PETRI_TRANSITIONS=292} [2025-03-14 01:43:22,461 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -7 predicate places. [2025-03-14 01:43:22,461 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 292 transitions, 594 flow [2025-03-14 01:43:22,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:22,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:22,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:22,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:43:22,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:22,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:22,462 INFO L85 PathProgramCache]: Analyzing trace with hash 690660607, now seen corresponding path program 1 times [2025-03-14 01:43:22,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:22,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820145651] [2025-03-14 01:43:22,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:22,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:22,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:43:22,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:43:22,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:22,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:22,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:22,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820145651] [2025-03-14 01:43:22,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820145651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:22,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:22,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:22,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66897249] [2025-03-14 01:43:22,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:22,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:22,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:22,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:22,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:22,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-03-14 01:43:22,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 292 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:22,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:22,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-03-14 01:43:22,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:22,592 INFO L124 PetriNetUnfolderBase]: 20/460 cut-off events. [2025-03-14 01:43:22,592 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:43:22,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 460 events. 20/460 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1967 event pairs, 8 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 460. Up to 29 conditions per place. [2025-03-14 01:43:22,597 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-03-14 01:43:22,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 291 transitions, 620 flow [2025-03-14 01:43:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2025-03-14 01:43:22,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384615384615385 [2025-03-14 01:43:22,602 INFO L175 Difference]: Start difference. First operand has 292 places, 292 transitions, 594 flow. Second operand 3 states and 915 transitions. [2025-03-14 01:43:22,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 291 transitions, 620 flow [2025-03-14 01:43:22,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 291 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:22,608 INFO L231 Difference]: Finished difference. Result has 291 places, 291 transitions, 592 flow [2025-03-14 01:43:22,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=291, PETRI_TRANSITIONS=291} [2025-03-14 01:43:22,609 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -8 predicate places. [2025-03-14 01:43:22,610 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 291 transitions, 592 flow [2025-03-14 01:43:22,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:22,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:22,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:22,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:43:22,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:22,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1077287598, now seen corresponding path program 1 times [2025-03-14 01:43:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840619879] [2025-03-14 01:43:22,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:22,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:22,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:43:22,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:43:22,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:22,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:22,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840619879] [2025-03-14 01:43:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840619879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:22,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:22,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397700047] [2025-03-14 01:43:22,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:22,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:22,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:22,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:22,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:22,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2025-03-14 01:43:22,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 291 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:22,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:22,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2025-03-14 01:43:22,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:22,746 INFO L124 PetriNetUnfolderBase]: 15/424 cut-off events. [2025-03-14 01:43:22,746 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-14 01:43:22,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 424 events. 15/424 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1680 event pairs, 5 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 407. Up to 22 conditions per place. [2025-03-14 01:43:22,750 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2025-03-14 01:43:22,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 290 transitions, 616 flow [2025-03-14 01:43:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2025-03-14 01:43:22,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2025-03-14 01:43:22,752 INFO L175 Difference]: Start difference. First operand has 291 places, 291 transitions, 592 flow. Second operand 3 states and 917 transitions. [2025-03-14 01:43:22,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 290 transitions, 616 flow [2025-03-14 01:43:22,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 290 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:22,756 INFO L231 Difference]: Finished difference. Result has 290 places, 290 transitions, 590 flow [2025-03-14 01:43:22,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=290, PETRI_TRANSITIONS=290} [2025-03-14 01:43:22,757 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -9 predicate places. [2025-03-14 01:43:22,757 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 290 transitions, 590 flow [2025-03-14 01:43:22,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:22,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:22,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:22,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:43:22,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:22,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash -298245073, now seen corresponding path program 1 times [2025-03-14 01:43:22,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:22,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-03-14 01:43:22,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:22,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:43:22,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:43:22,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:22,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:22,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:22,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-03-14 01:43:22,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141021097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:22,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:22,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:22,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49464005] [2025-03-14 01:43:22,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:22,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:22,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:22,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:22,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 325 [2025-03-14 01:43:22,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 290 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:22,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:22,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 325 [2025-03-14 01:43:22,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:22,936 INFO L124 PetriNetUnfolderBase]: 42/733 cut-off events. [2025-03-14 01:43:22,937 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-03-14 01:43:22,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 733 events. 42/733 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3758 event pairs, 20 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 736. Up to 50 conditions per place. [2025-03-14 01:43:22,942 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-03-14 01:43:22,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 289 transitions, 618 flow [2025-03-14 01:43:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2025-03-14 01:43:22,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9364102564102564 [2025-03-14 01:43:22,944 INFO L175 Difference]: Start difference. First operand has 290 places, 290 transitions, 590 flow. Second operand 3 states and 913 transitions. [2025-03-14 01:43:22,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 289 transitions, 618 flow [2025-03-14 01:43:22,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 289 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:22,948 INFO L231 Difference]: Finished difference. Result has 289 places, 289 transitions, 588 flow [2025-03-14 01:43:22,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2025-03-14 01:43:22,952 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2025-03-14 01:43:22,953 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 588 flow [2025-03-14 01:43:22,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:22,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:22,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:22,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:43:22,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:22,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:22,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1662368828, now seen corresponding path program 1 times [2025-03-14 01:43:22,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:22,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044687567] [2025-03-14 01:43:22,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:22,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:22,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-14 01:43:22,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 01:43:22,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:22,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:23,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044687567] [2025-03-14 01:43:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044687567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:23,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437544542] [2025-03-14 01:43:23,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:23,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:23,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:23,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:23,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:23,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2025-03-14 01:43:23,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:23,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2025-03-14 01:43:23,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:23,084 INFO L124 PetriNetUnfolderBase]: 15/361 cut-off events. [2025-03-14 01:43:23,085 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-14 01:43:23,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 361 events. 15/361 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1262 event pairs, 7 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 330. Up to 25 conditions per place. [2025-03-14 01:43:23,090 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-03-14 01:43:23,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 288 transitions, 612 flow [2025-03-14 01:43:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2025-03-14 01:43:23,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2025-03-14 01:43:23,093 INFO L175 Difference]: Start difference. First operand has 289 places, 289 transitions, 588 flow. Second operand 3 states and 917 transitions. [2025-03-14 01:43:23,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 288 transitions, 612 flow [2025-03-14 01:43:23,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 288 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:23,098 INFO L231 Difference]: Finished difference. Result has 288 places, 288 transitions, 586 flow [2025-03-14 01:43:23,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=288, PETRI_TRANSITIONS=288} [2025-03-14 01:43:23,099 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2025-03-14 01:43:23,099 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 288 transitions, 586 flow [2025-03-14 01:43:23,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:23,100 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-14 01:43:23,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:43:23,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:23,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2045158307, now seen corresponding path program 1 times [2025-03-14 01:43:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078248483] [2025-03-14 01:43:23,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:23,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-14 01:43:23,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-14 01:43:23,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:23,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:23,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078248483] [2025-03-14 01:43:23,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078248483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:23,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:23,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:23,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948313281] [2025-03-14 01:43:23,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:23,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:23,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:23,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:23,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:23,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-03-14 01:43:23,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 288 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:23,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-03-14 01:43:23,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:23,253 INFO L124 PetriNetUnfolderBase]: 46/884 cut-off events. [2025-03-14 01:43:23,253 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:43:23,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 884 events. 46/884 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5571 event pairs, 12 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 875. Up to 43 conditions per place. [2025-03-14 01:43:23,260 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2025-03-14 01:43:23,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 290 transitions, 622 flow [2025-03-14 01:43:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2025-03-14 01:43:23,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2025-03-14 01:43:23,263 INFO L175 Difference]: Start difference. First operand has 288 places, 288 transitions, 586 flow. Second operand 3 states and 926 transitions. [2025-03-14 01:43:23,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 290 transitions, 622 flow [2025-03-14 01:43:23,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 290 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:23,269 INFO L231 Difference]: Finished difference. Result has 287 places, 288 transitions, 592 flow [2025-03-14 01:43:23,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=287, PETRI_TRANSITIONS=288} [2025-03-14 01:43:23,271 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2025-03-14 01:43:23,271 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 288 transitions, 592 flow [2025-03-14 01:43:23,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:23,273 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] [2025-03-14 01:43:23,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:43:23,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:23,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1094319507, now seen corresponding path program 1 times [2025-03-14 01:43:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:23,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070261318] [2025-03-14 01:43:23,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:23,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:23,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-14 01:43:23,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-14 01:43:23,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:23,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070261318] [2025-03-14 01:43:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070261318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:23,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:23,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:23,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086096615] [2025-03-14 01:43:23,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:23,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:23,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:23,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:23,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-03-14 01:43:23,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 288 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:23,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-03-14 01:43:23,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:23,424 INFO L124 PetriNetUnfolderBase]: 45/803 cut-off events. [2025-03-14 01:43:23,424 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:43:23,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 803 events. 45/803 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4863 event pairs, 10 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 733. Up to 49 conditions per place. [2025-03-14 01:43:23,432 INFO L140 encePairwiseOnDemand]: 319/325 looper letters, 15 selfloop transitions, 3 changer transitions 0/290 dead transitions. [2025-03-14 01:43:23,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 290 transitions, 634 flow [2025-03-14 01:43:23,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2025-03-14 01:43:23,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9446153846153846 [2025-03-14 01:43:23,434 INFO L175 Difference]: Start difference. First operand has 287 places, 288 transitions, 592 flow. Second operand 3 states and 921 transitions. [2025-03-14 01:43:23,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 290 transitions, 634 flow [2025-03-14 01:43:23,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 290 transitions, 634 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:23,437 INFO L231 Difference]: Finished difference. Result has 287 places, 288 transitions, 607 flow [2025-03-14 01:43:23,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=287, PETRI_TRANSITIONS=288} [2025-03-14 01:43:23,438 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2025-03-14 01:43:23,438 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 288 transitions, 607 flow [2025-03-14 01:43:23,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:23,438 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] [2025-03-14 01:43:23,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:43:23,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:23,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2040416468, now seen corresponding path program 1 times [2025-03-14 01:43:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:23,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516478184] [2025-03-14 01:43:23,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:23,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-14 01:43:23,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-14 01:43:23,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:23,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:23,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-14 01:43:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:23,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516478184] [2025-03-14 01:43:23,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516478184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:23,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:23,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612042417] [2025-03-14 01:43:23,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:23,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:23,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:23,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:23,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:23,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-03-14 01:43:23,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 288 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:23,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-03-14 01:43:23,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:23,575 INFO L124 PetriNetUnfolderBase]: 38/959 cut-off events. [2025-03-14 01:43:23,575 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2025-03-14 01:43:23,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 959 events. 38/959 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5901 event pairs, 4 based on Foata normal form. 1/853 useless extension candidates. Maximal degree in co-relation 847. Up to 53 conditions per place. [2025-03-14 01:43:23,585 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 16 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-03-14 01:43:23,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 293 transitions, 658 flow [2025-03-14 01:43:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2025-03-14 01:43:23,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528205128205128 [2025-03-14 01:43:23,587 INFO L175 Difference]: Start difference. First operand has 287 places, 288 transitions, 607 flow. Second operand 3 states and 929 transitions. [2025-03-14 01:43:23,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 293 transitions, 658 flow [2025-03-14 01:43:23,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 293 transitions, 658 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:23,590 INFO L231 Difference]: Finished difference. Result has 288 places, 288 transitions, 617 flow [2025-03-14 01:43:23,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=288, PETRI_TRANSITIONS=288} [2025-03-14 01:43:23,591 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2025-03-14 01:43:23,591 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 288 transitions, 617 flow [2025-03-14 01:43:23,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:23,592 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] [2025-03-14 01:43:23,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:43:23,592 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:23,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1959849039, now seen corresponding path program 1 times [2025-03-14 01:43:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:23,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116822423] [2025-03-14 01:43:23,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:23,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-14 01:43:23,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:43:23,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:23,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116822423] [2025-03-14 01:43:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116822423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855620889] [2025-03-14 01:43:23,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:23,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:23,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:23,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:23,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:23,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-03-14 01:43:23,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 288 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:23,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-03-14 01:43:23,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:23,753 INFO L124 PetriNetUnfolderBase]: 33/1027 cut-off events. [2025-03-14 01:43:23,753 INFO L125 PetriNetUnfolderBase]: For 15/25 co-relation queries the response was YES. [2025-03-14 01:43:23,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 1027 events. 33/1027 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5854 event pairs, 4 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 965. Up to 51 conditions per place. [2025-03-14 01:43:23,763 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 16 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-03-14 01:43:23,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 293 transitions, 668 flow [2025-03-14 01:43:23,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2025-03-14 01:43:23,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528205128205128 [2025-03-14 01:43:23,765 INFO L175 Difference]: Start difference. First operand has 288 places, 288 transitions, 617 flow. Second operand 3 states and 929 transitions. [2025-03-14 01:43:23,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 293 transitions, 668 flow [2025-03-14 01:43:23,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 293 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:23,768 INFO L231 Difference]: Finished difference. Result has 289 places, 288 transitions, 627 flow [2025-03-14 01:43:23,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=289, PETRI_TRANSITIONS=288} [2025-03-14 01:43:23,768 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2025-03-14 01:43:23,768 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 288 transitions, 627 flow [2025-03-14 01:43:23,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:23,769 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] [2025-03-14 01:43:23,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:43:23,769 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:23,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash -729631858, now seen corresponding path program 1 times [2025-03-14 01:43:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:23,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073407749] [2025-03-14 01:43:23,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:23,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-14 01:43:23,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:43:23,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:23,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:23,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:23,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073407749] [2025-03-14 01:43:23,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073407749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:23,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237270879] [2025-03-14 01:43:23,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:23,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:23,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:23,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:23,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 325 [2025-03-14 01:43:23,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 288 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:23,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 325 [2025-03-14 01:43:23,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:23,915 INFO L124 PetriNetUnfolderBase]: 34/997 cut-off events. [2025-03-14 01:43:23,915 INFO L125 PetriNetUnfolderBase]: For 4/17 co-relation queries the response was YES. [2025-03-14 01:43:23,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 997 events. 34/997 cut-off events. For 4/17 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5847 event pairs, 8 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 965. Up to 38 conditions per place. [2025-03-14 01:43:23,925 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-03-14 01:43:23,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 657 flow [2025-03-14 01:43:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2025-03-14 01:43:23,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2025-03-14 01:43:23,928 INFO L175 Difference]: Start difference. First operand has 289 places, 288 transitions, 627 flow. Second operand 3 states and 926 transitions. [2025-03-14 01:43:23,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 657 flow [2025-03-14 01:43:23,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 657 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:23,932 INFO L231 Difference]: Finished difference. Result has 290 places, 287 transitions, 629 flow [2025-03-14 01:43:23,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=290, PETRI_TRANSITIONS=287} [2025-03-14 01:43:23,933 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -9 predicate places. [2025-03-14 01:43:23,933 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 287 transitions, 629 flow [2025-03-14 01:43:23,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:23,934 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] [2025-03-14 01:43:23,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:43:23,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:23,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1578676253, now seen corresponding path program 1 times [2025-03-14 01:43:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794331924] [2025-03-14 01:43:23,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:23,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-14 01:43:23,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-14 01:43:23,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:23,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:23,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:23,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794331924] [2025-03-14 01:43:23,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794331924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:23,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:23,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908285582] [2025-03-14 01:43:23,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:23,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:23,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:23,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:23,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 325 [2025-03-14 01:43:23,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 287 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:23,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:23,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 325 [2025-03-14 01:43:23,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:24,246 INFO L124 PetriNetUnfolderBase]: 226/2802 cut-off events. [2025-03-14 01:43:24,246 INFO L125 PetriNetUnfolderBase]: For 71/221 co-relation queries the response was YES. [2025-03-14 01:43:24,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 2802 events. 226/2802 cut-off events. For 71/221 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 25442 event pairs, 100 based on Foata normal form. 1/2502 useless extension candidates. Maximal degree in co-relation 2762. Up to 329 conditions per place. [2025-03-14 01:43:24,266 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 17 selfloop transitions, 4 changer transitions 0/289 dead transitions. [2025-03-14 01:43:24,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 289 transitions, 677 flow [2025-03-14 01:43:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2025-03-14 01:43:24,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9394871794871795 [2025-03-14 01:43:24,268 INFO L175 Difference]: Start difference. First operand has 290 places, 287 transitions, 629 flow. Second operand 3 states and 916 transitions. [2025-03-14 01:43:24,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 289 transitions, 677 flow [2025-03-14 01:43:24,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:24,272 INFO L231 Difference]: Finished difference. Result has 287 places, 287 transitions, 645 flow [2025-03-14 01:43:24,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=287, PETRI_TRANSITIONS=287} [2025-03-14 01:43:24,273 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2025-03-14 01:43:24,273 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 287 transitions, 645 flow [2025-03-14 01:43:24,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:24,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:24,274 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] [2025-03-14 01:43:24,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:43:24,274 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:24,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:24,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1589539902, now seen corresponding path program 1 times [2025-03-14 01:43:24,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:24,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062574041] [2025-03-14 01:43:24,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:24,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-14 01:43:24,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:43:24,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:24,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:24,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:24,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062574041] [2025-03-14 01:43:24,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062574041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:24,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:24,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:24,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61501919] [2025-03-14 01:43:24,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:24,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:24,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:24,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:24,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:24,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-03-14 01:43:24,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 287 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:24,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:24,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-03-14 01:43:24,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:24,570 INFO L124 PetriNetUnfolderBase]: 108/2656 cut-off events. [2025-03-14 01:43:24,571 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2025-03-14 01:43:24,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 2656 events. 108/2656 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 23490 event pairs, 14 based on Foata normal form. 0/2405 useless extension candidates. Maximal degree in co-relation 2473. Up to 164 conditions per place. [2025-03-14 01:43:24,587 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 15 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-03-14 01:43:24,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 291 transitions, 691 flow [2025-03-14 01:43:24,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-03-14 01:43:24,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2025-03-14 01:43:24,589 INFO L175 Difference]: Start difference. First operand has 287 places, 287 transitions, 645 flow. Second operand 3 states and 928 transitions. [2025-03-14 01:43:24,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 291 transitions, 691 flow [2025-03-14 01:43:24,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 291 transitions, 691 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:24,592 INFO L231 Difference]: Finished difference. Result has 288 places, 287 transitions, 655 flow [2025-03-14 01:43:24,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=288, PETRI_TRANSITIONS=287} [2025-03-14 01:43:24,593 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2025-03-14 01:43:24,593 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 287 transitions, 655 flow [2025-03-14 01:43:24,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:24,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:24,594 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] [2025-03-14 01:43:24,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:43:24,594 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:24,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1099940995, now seen corresponding path program 1 times [2025-03-14 01:43:24,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:24,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546684507] [2025-03-14 01:43:24,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:24,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:24,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-14 01:43:24,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:43:24,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:24,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:24,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:24,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546684507] [2025-03-14 01:43:24,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546684507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:24,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:24,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:24,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459205240] [2025-03-14 01:43:24,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:24,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:24,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:24,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:24,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:24,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-03-14 01:43:24,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 287 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:24,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:24,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-03-14 01:43:24,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:24,828 INFO L124 PetriNetUnfolderBase]: 97/2277 cut-off events. [2025-03-14 01:43:24,828 INFO L125 PetriNetUnfolderBase]: For 24/60 co-relation queries the response was YES. [2025-03-14 01:43:24,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 2277 events. 97/2277 cut-off events. For 24/60 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 19438 event pairs, 18 based on Foata normal form. 2/2073 useless extension candidates. Maximal degree in co-relation 2097. Up to 73 conditions per place. [2025-03-14 01:43:24,845 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-03-14 01:43:24,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 288 transitions, 687 flow [2025-03-14 01:43:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-03-14 01:43:24,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-03-14 01:43:24,848 INFO L175 Difference]: Start difference. First operand has 288 places, 287 transitions, 655 flow. Second operand 3 states and 924 transitions. [2025-03-14 01:43:24,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 288 transitions, 687 flow [2025-03-14 01:43:24,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 687 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:24,851 INFO L231 Difference]: Finished difference. Result has 289 places, 286 transitions, 657 flow [2025-03-14 01:43:24,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=289, PETRI_TRANSITIONS=286} [2025-03-14 01:43:24,852 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2025-03-14 01:43:24,852 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 286 transitions, 657 flow [2025-03-14 01:43:24,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:24,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:24,853 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] [2025-03-14 01:43:24,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:43:24,853 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:24,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:24,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1879038572, now seen corresponding path program 1 times [2025-03-14 01:43:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:24,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068505017] [2025-03-14 01:43:24,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:24,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-14 01:43:24,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:43:24,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:24,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:24,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:24,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068505017] [2025-03-14 01:43:24,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068505017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:24,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:24,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:24,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268577513] [2025-03-14 01:43:24,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:24,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:24,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:24,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:24,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-03-14 01:43:24,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 286 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:24,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:24,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-03-14 01:43:24,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:25,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([788] L55-6-->L55-5: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet12#1][181], [Black: 349#true, 368#true, Black: 353#true, 362#(= |#race~length_4~0| 0), 366#(= |#race~to_int_5~0| 0), Black: 360#true, 343#(= |#race~length_0~0| 0), Black: 364#true, 136#L55-5true, 347#(= |#race~length_2~0| 0), 250#L77true, Black: 341#true, 351#(= |#race~to_int_1~0| 0), 371#true, Black: 345#true, 355#(= |#race~to_int_3~0| 0)]) [2025-03-14 01:43:25,059 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2025-03-14 01:43:25,059 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is not cut-off event [2025-03-14 01:43:25,059 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-03-14 01:43:25,059 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-03-14 01:43:25,061 INFO L124 PetriNetUnfolderBase]: 131/1723 cut-off events. [2025-03-14 01:43:25,062 INFO L125 PetriNetUnfolderBase]: For 86/123 co-relation queries the response was YES. [2025-03-14 01:43:25,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 1723 events. 131/1723 cut-off events. For 86/123 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 14151 event pairs, 36 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 1885. Up to 169 conditions per place. [2025-03-14 01:43:25,072 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-03-14 01:43:25,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 287 transitions, 689 flow [2025-03-14 01:43:25,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-03-14 01:43:25,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-03-14 01:43:25,074 INFO L175 Difference]: Start difference. First operand has 289 places, 286 transitions, 657 flow. Second operand 3 states and 924 transitions. [2025-03-14 01:43:25,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 287 transitions, 689 flow [2025-03-14 01:43:25,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 287 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:25,078 INFO L231 Difference]: Finished difference. Result has 288 places, 285 transitions, 655 flow [2025-03-14 01:43:25,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=288, PETRI_TRANSITIONS=285} [2025-03-14 01:43:25,078 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2025-03-14 01:43:25,078 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 285 transitions, 655 flow [2025-03-14 01:43:25,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:25,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:25,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:25,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:43:25,079 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:25,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash 235572093, now seen corresponding path program 1 times [2025-03-14 01:43:25,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:25,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837671838] [2025-03-14 01:43:25,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:25,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:25,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-14 01:43:25,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-14 01:43:25,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:25,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:25,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:25,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837671838] [2025-03-14 01:43:25,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837671838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:25,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:25,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012812269] [2025-03-14 01:43:25,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:25,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:25,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:25,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:25,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:25,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 325 [2025-03-14 01:43:25,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 285 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:25,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:25,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 325 [2025-03-14 01:43:25,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:25,313 INFO L124 PetriNetUnfolderBase]: 68/2037 cut-off events. [2025-03-14 01:43:25,313 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2025-03-14 01:43:25,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 2037 events. 68/2037 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 16325 event pairs, 4 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 2046. Up to 66 conditions per place. [2025-03-14 01:43:25,325 INFO L140 encePairwiseOnDemand]: 323/325 looper letters, 8 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2025-03-14 01:43:25,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 284 transitions, 671 flow [2025-03-14 01:43:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-03-14 01:43:25,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2025-03-14 01:43:25,328 INFO L175 Difference]: Start difference. First operand has 288 places, 285 transitions, 655 flow. Second operand 3 states and 928 transitions. [2025-03-14 01:43:25,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 284 transitions, 671 flow [2025-03-14 01:43:25,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:25,332 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 651 flow [2025-03-14 01:43:25,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=651, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2025-03-14 01:43:25,332 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2025-03-14 01:43:25,332 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 651 flow [2025-03-14 01:43:25,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:25,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:25,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:25,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:43:25,333 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:25,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:25,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1230112392, now seen corresponding path program 1 times [2025-03-14 01:43:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820111603] [2025-03-14 01:43:25,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:25,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:25,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-14 01:43:25,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-14 01:43:25,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:25,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:25,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:25,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820111603] [2025-03-14 01:43:25,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820111603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:25,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:25,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:25,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361304329] [2025-03-14 01:43:25,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:25,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:25,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:25,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:25,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:25,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-03-14 01:43:25,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:25,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:25,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-03-14 01:43:25,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:25,553 INFO L124 PetriNetUnfolderBase]: 70/2113 cut-off events. [2025-03-14 01:43:25,553 INFO L125 PetriNetUnfolderBase]: For 8/22 co-relation queries the response was YES. [2025-03-14 01:43:25,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2419 conditions, 2113 events. 70/2113 cut-off events. For 8/22 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 17207 event pairs, 9 based on Foata normal form. 0/1974 useless extension candidates. Maximal degree in co-relation 2290. Up to 70 conditions per place. [2025-03-14 01:43:25,561 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 10 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2025-03-14 01:43:25,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 282 transitions, 669 flow [2025-03-14 01:43:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 922 transitions. [2025-03-14 01:43:25,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456410256410256 [2025-03-14 01:43:25,563 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 651 flow. Second operand 3 states and 922 transitions. [2025-03-14 01:43:25,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 282 transitions, 669 flow [2025-03-14 01:43:25,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 282 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:25,566 INFO L231 Difference]: Finished difference. Result has 286 places, 282 transitions, 648 flow [2025-03-14 01:43:25,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=286, PETRI_TRANSITIONS=282} [2025-03-14 01:43:25,567 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -13 predicate places. [2025-03-14 01:43:25,567 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 282 transitions, 648 flow [2025-03-14 01:43:25,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:25,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:25,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:25,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:43:25,567 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:43:25,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:25,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2094588242, now seen corresponding path program 1 times [2025-03-14 01:43:25,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:25,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491329888] [2025-03-14 01:43:25,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:25,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-14 01:43:25,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-14 01:43:25,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:25,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491329888] [2025-03-14 01:43:25,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491329888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:25,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:25,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637712922] [2025-03-14 01:43:25,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:25,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:25,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:25,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:25,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:25,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-03-14 01:43:25,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 282 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:25,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:25,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-03-14 01:43:25,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:25,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([792] L55-5-->L55-3: Formula: (= |v_#race~result_8~0_3| |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, #race~result_8~0=|v_#race~result_8~0_3|} AuxVars[] AssignedVars[#race~result_8~0][187], [Black: 349#true, Black: 353#true, 362#(= |#race~length_4~0| 0), 366#(= |#race~to_int_5~0| 0), Black: 360#true, 275#L55-3true, 343#(= |#race~length_0~0| 0), Black: 364#true, 347#(= |#race~length_2~0| 0), Black: 341#true, 250#L77true, 380#true, 351#(= |#race~to_int_1~0| 0), 377#true, Black: 345#true, 355#(= |#race~to_int_3~0| 0)]) [2025-03-14 01:43:25,721 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2025-03-14 01:43:25,721 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 01:43:25,721 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 01:43:25,721 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 01:43:25,723 INFO L124 PetriNetUnfolderBase]: 68/1516 cut-off events. [2025-03-14 01:43:25,723 INFO L125 PetriNetUnfolderBase]: For 20/36 co-relation queries the response was YES. [2025-03-14 01:43:25,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1516 events. 68/1516 cut-off events. For 20/36 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11412 event pairs, 18 based on Foata normal form. 5/1415 useless extension candidates. Maximal degree in co-relation 1719. Up to 89 conditions per place. [2025-03-14 01:43:25,732 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 0 selfloop transitions, 0 changer transitions 280/280 dead transitions. [2025-03-14 01:43:25,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 280 transitions, 664 flow [2025-03-14 01:43:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2025-03-14 01:43:25,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9446153846153846 [2025-03-14 01:43:25,734 INFO L175 Difference]: Start difference. First operand has 286 places, 282 transitions, 648 flow. Second operand 3 states and 921 transitions. [2025-03-14 01:43:25,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 280 transitions, 664 flow [2025-03-14 01:43:25,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 280 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:25,736 INFO L231 Difference]: Finished difference. Result has 285 places, 0 transitions, 0 flow [2025-03-14 01:43:25,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=285, PETRI_TRANSITIONS=0} [2025-03-14 01:43:25,737 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -14 predicate places. [2025-03-14 01:43:25,737 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 0 transitions, 0 flow [2025-03-14 01:43:25,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2025-03-14 01:43:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2025-03-14 01:43:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2025-03-14 01:43:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2025-03-14 01:43:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2025-03-14 01:43:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2025-03-14 01:43:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2025-03-14 01:43:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2025-03-14 01:43:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2025-03-14 01:43:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2025-03-14 01:43:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2025-03-14 01:43:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2025-03-14 01:43:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2025-03-14 01:43:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2025-03-14 01:43:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2025-03-14 01:43:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2025-03-14 01:43:25,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:43:25,741 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:25,746 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:43:25,747 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:43:25,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:43:25 BasicIcfg [2025-03-14 01:43:25,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:43:25,753 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:43:25,753 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:43:25,753 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:43:25,754 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:43:21" (3/4) ... [2025-03-14 01:43:25,755 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:43:25,757 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:43:25,757 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:43:25,757 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:43:25,760 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-14 01:43:25,762 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:43:25,762 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:43:25,762 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:43:25,826 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:43:25,826 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:43:25,826 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:43:25,827 INFO L158 Benchmark]: Toolchain (without parser) took 4861.69ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 112.6MB in the beginning and 117.4MB in the end (delta: -4.8MB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB. [2025-03-14 01:43:25,827 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:43:25,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.53ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 100.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:43:25,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.48ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 98.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:43:25,829 INFO L158 Benchmark]: Boogie Preprocessor took 16.61ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:43:25,829 INFO L158 Benchmark]: IcfgBuilder took 445.35ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 74.9MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:43:25,830 INFO L158 Benchmark]: TraceAbstraction took 4125.69ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 74.4MB in the beginning and 125.8MB in the end (delta: -51.4MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2025-03-14 01:43:25,830 INFO L158 Benchmark]: Witness Printer took 73.26ms. Allocated memory is still 302.0MB. Free memory was 125.8MB in the beginning and 117.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:43:25,831 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.53ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 100.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.48ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 98.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.61ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 445.35ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 74.9MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4125.69ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 74.4MB in the beginning and 125.8MB in the end (delta: -51.4MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. * Witness Printer took 73.26ms. Allocated memory is still 302.0MB. Free memory was 125.8MB in the beginning and 117.4MB 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: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: 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 7 procedures, 488 locations, 50 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: 4.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 87 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=657occurred in iteration=14, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1477 NumberOfCodeBlocks, 1477 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:43:25,845 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