./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp2x9.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/bench-exp2x9.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 af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:42:08,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:42:08,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:42:08,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:42:08,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:42:08,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:42:08,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:42:08,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:42:08,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:42:08,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:42:08,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:42:08,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:42:08,607 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:42:08,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:42:08,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:42:08,607 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:42:08,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:42:08,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:42:08,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:42:08,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:42:08,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:42:08,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:42:08,608 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:42:08,608 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:42:08,608 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:42:08,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:42:08,608 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:42:08,608 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:42:08,608 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:42:08,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:42:08,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:42:08,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:08,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:42:08,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:42:08,609 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:42:08,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:42:08,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:42:08,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:42:08,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:42:08,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:42:08,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:42:08,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:42:08,609 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 -> af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 [2025-03-14 01:42:08,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:42:08,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:42:08,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:42:08,828 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:42:08,828 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:42:08,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-03-14 01:42:09,949 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac615837d/810aedeecbf3470c946c6aedf8860832/FLAGcfda0d79d [2025-03-14 01:42:10,175 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:42:10,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-03-14 01:42:10,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac615837d/810aedeecbf3470c946c6aedf8860832/FLAGcfda0d79d [2025-03-14 01:42:10,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac615837d/810aedeecbf3470c946c6aedf8860832 [2025-03-14 01:42:10,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:42:10,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:42:10,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:10,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:42:10,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:42:10,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a292954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10, skipping insertion in model container [2025-03-14 01:42:10,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:42:10,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:10,688 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:42:10,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:10,718 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:42:10,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10 WrapperNode [2025-03-14 01:42:10,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:10,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:10,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:42:10,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:42:10,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,741 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-03-14 01:42:10,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:10,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:42:10,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:42:10,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:42:10,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,765 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:42:10,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:42:10,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:42:10,776 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:42:10,777 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (1/1) ... [2025-03-14 01:42:10,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:42:10,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:42:10,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:42:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:42:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:42:10,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:42:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:42:10,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:42:10,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:42:10,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:42:10,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-14 01:42:10,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-14 01:42:10,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:42:10,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:42:10,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:42:10,824 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:42:10,896 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:42:10,897 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:42:11,372 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:42:11,373 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:42:11,373 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:42:11,391 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:42:11,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:11 BoogieIcfgContainer [2025-03-14 01:42:11,391 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:42:11,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:42:11,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:42:11,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:42:11,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:42:10" (1/3) ... [2025-03-14 01:42:11,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f332e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:11, skipping insertion in model container [2025-03-14 01:42:11,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:10" (2/3) ... [2025-03-14 01:42:11,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f332e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:11, skipping insertion in model container [2025-03-14 01:42:11,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:11" (3/3) ... [2025-03-14 01:42:11,402 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2025-03-14 01:42:11,413 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:42:11,415 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x9.wvr.c that has 5 procedures, 534 locations, 1 initial locations, 4 loop locations, and 107 error locations. [2025-03-14 01:42:11,415 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:42:11,518 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 01:42:11,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 546 places, 547 transitions, 1122 flow [2025-03-14 01:42:11,733 INFO L124 PetriNetUnfolderBase]: 14/543 cut-off events. [2025-03-14 01:42:11,739 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:42:11,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 543 events. 14/543 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1805 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 413. Up to 2 conditions per place. [2025-03-14 01:42:11,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 546 places, 547 transitions, 1122 flow [2025-03-14 01:42:11,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 524 places, 523 transitions, 1070 flow [2025-03-14 01:42:11,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:42:11,795 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;@564723b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:42:11,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 203 error locations. [2025-03-14 01:42:11,801 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:42:11,801 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-14 01:42:11,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:42:11,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:11,802 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] [2025-03-14 01:42:11,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:11,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash -194621866, now seen corresponding path program 1 times [2025-03-14 01:42:11,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:11,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057773489] [2025-03-14 01:42:11,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:11,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:11,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:42:11,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:42:11,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:11,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:11,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057773489] [2025-03-14 01:42:11,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057773489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:11,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:11,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:11,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611047314] [2025-03-14 01:42:11,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:11,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:11,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:11,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:12,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 547 [2025-03-14 01:42:12,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 523 transitions, 1070 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:12,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:12,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 547 [2025-03-14 01:42:12,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:12,346 INFO L124 PetriNetUnfolderBase]: 76/868 cut-off events. [2025-03-14 01:42:12,351 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-14 01:42:12,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 868 events. 76/868 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4801 event pairs, 66 based on Foata normal form. 145/825 useless extension candidates. Maximal degree in co-relation 1049. Up to 172 conditions per place. [2025-03-14 01:42:12,378 INFO L140 encePairwiseOnDemand]: 539/547 looper letters, 36 selfloop transitions, 2 changer transitions 1/517 dead transitions. [2025-03-14 01:42:12,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 517 transitions, 1134 flow [2025-03-14 01:42:12,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1544 transitions. [2025-03-14 01:42:12,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9408897014015845 [2025-03-14 01:42:12,399 INFO L175 Difference]: Start difference. First operand has 524 places, 523 transitions, 1070 flow. Second operand 3 states and 1544 transitions. [2025-03-14 01:42:12,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 517 transitions, 1134 flow [2025-03-14 01:42:12,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 517 transitions, 1118 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:42:12,419 INFO L231 Difference]: Finished difference. Result has 517 places, 516 transitions, 1044 flow [2025-03-14 01:42:12,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=517, PETRI_TRANSITIONS=516} [2025-03-14 01:42:12,425 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -7 predicate places. [2025-03-14 01:42:12,425 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 516 transitions, 1044 flow [2025-03-14 01:42:12,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:12,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:12,426 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] [2025-03-14 01:42:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:42:12,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:12,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1223025836, now seen corresponding path program 1 times [2025-03-14 01:42:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:12,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361088907] [2025-03-14 01:42:12,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:12,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:12,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:42:12,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:42:12,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:12,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:12,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:12,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361088907] [2025-03-14 01:42:12,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361088907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:12,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:12,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488456164] [2025-03-14 01:42:12,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:12,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:12,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:12,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:12,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:12,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 547 [2025-03-14 01:42:12,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 516 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:12,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:12,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 547 [2025-03-14 01:42:12,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:12,764 INFO L124 PetriNetUnfolderBase]: 76/866 cut-off events. [2025-03-14 01:42:12,765 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:42:12,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 866 events. 76/866 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4974 event pairs, 66 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 1061. Up to 171 conditions per place. [2025-03-14 01:42:12,789 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 35 selfloop transitions, 2 changer transitions 0/515 dead transitions. [2025-03-14 01:42:12,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 515 transitions, 1116 flow [2025-03-14 01:42:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2025-03-14 01:42:12,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9390615478366849 [2025-03-14 01:42:12,796 INFO L175 Difference]: Start difference. First operand has 517 places, 516 transitions, 1044 flow. Second operand 3 states and 1541 transitions. [2025-03-14 01:42:12,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 515 transitions, 1116 flow [2025-03-14 01:42:12,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 515 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:12,803 INFO L231 Difference]: Finished difference. Result has 515 places, 515 transitions, 1042 flow [2025-03-14 01:42:12,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=515, PETRI_TRANSITIONS=515} [2025-03-14 01:42:12,805 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -9 predicate places. [2025-03-14 01:42:12,805 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 515 transitions, 1042 flow [2025-03-14 01:42:12,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:12,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:12,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:12,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:42:12,806 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:12,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:12,807 INFO L85 PathProgramCache]: Analyzing trace with hash 241717247, now seen corresponding path program 1 times [2025-03-14 01:42:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:12,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488957145] [2025-03-14 01:42:12,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:12,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:12,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:42:12,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:42:12,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:12,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:12,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:12,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488957145] [2025-03-14 01:42:12,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488957145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:12,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:12,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286336800] [2025-03-14 01:42:12,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:12,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:12,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:12,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:12,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 547 [2025-03-14 01:42:12,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 515 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:12,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:12,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 547 [2025-03-14 01:42:12,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:13,206 INFO L124 PetriNetUnfolderBase]: 76/793 cut-off events. [2025-03-14 01:42:13,207 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-14 01:42:13,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 793 events. 76/793 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4324 event pairs, 66 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 960. Up to 172 conditions per place. [2025-03-14 01:42:13,236 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/514 dead transitions. [2025-03-14 01:42:13,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 514 transitions, 1116 flow [2025-03-14 01:42:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1539 transitions. [2025-03-14 01:42:13,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9378427787934186 [2025-03-14 01:42:13,240 INFO L175 Difference]: Start difference. First operand has 515 places, 515 transitions, 1042 flow. Second operand 3 states and 1539 transitions. [2025-03-14 01:42:13,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 514 transitions, 1116 flow [2025-03-14 01:42:13,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 514 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:13,248 INFO L231 Difference]: Finished difference. Result has 514 places, 514 transitions, 1040 flow [2025-03-14 01:42:13,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=514, PETRI_TRANSITIONS=514} [2025-03-14 01:42:13,250 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -10 predicate places. [2025-03-14 01:42:13,250 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 514 transitions, 1040 flow [2025-03-14 01:42:13,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:13,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:13,252 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] [2025-03-14 01:42:13,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:42:13,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:13,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:13,252 INFO L85 PathProgramCache]: Analyzing trace with hash 399293554, now seen corresponding path program 1 times [2025-03-14 01:42:13,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:13,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125504600] [2025-03-14 01:42:13,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:13,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:13,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:42:13,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:42:13,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:13,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:13,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125504600] [2025-03-14 01:42:13,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125504600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:13,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:13,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139903192] [2025-03-14 01:42:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:13,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:13,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:13,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:13,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:13,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 547 [2025-03-14 01:42:13,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 514 transitions, 1040 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:13,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:13,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 547 [2025-03-14 01:42:13,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:13,610 INFO L124 PetriNetUnfolderBase]: 76/720 cut-off events. [2025-03-14 01:42:13,610 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-14 01:42:13,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 720 events. 76/720 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3619 event pairs, 66 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 857. Up to 171 conditions per place. [2025-03-14 01:42:13,635 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 35 selfloop transitions, 2 changer transitions 0/513 dead transitions. [2025-03-14 01:42:13,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 513 transitions, 1112 flow [2025-03-14 01:42:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2025-03-14 01:42:13,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9390615478366849 [2025-03-14 01:42:13,640 INFO L175 Difference]: Start difference. First operand has 514 places, 514 transitions, 1040 flow. Second operand 3 states and 1541 transitions. [2025-03-14 01:42:13,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 513 transitions, 1112 flow [2025-03-14 01:42:13,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 513 transitions, 1108 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:13,653 INFO L231 Difference]: Finished difference. Result has 513 places, 513 transitions, 1038 flow [2025-03-14 01:42:13,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1038, PETRI_PLACES=513, PETRI_TRANSITIONS=513} [2025-03-14 01:42:13,655 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -11 predicate places. [2025-03-14 01:42:13,655 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 513 transitions, 1038 flow [2025-03-14 01:42:13,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:13,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:13,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:13,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:42:13,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:13,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1296327910, now seen corresponding path program 1 times [2025-03-14 01:42:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:13,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176388434] [2025-03-14 01:42:13,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:13,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:13,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:42:13,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:42:13,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:13,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:13,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176388434] [2025-03-14 01:42:13,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176388434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:13,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:13,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257927838] [2025-03-14 01:42:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:13,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:13,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:13,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:13,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:13,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 521 out of 547 [2025-03-14 01:42:13,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 513 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 522.3333333333334) internal successors, (1567), 3 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:13,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:13,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 521 of 547 [2025-03-14 01:42:13,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:14,290 INFO L124 PetriNetUnfolderBase]: 102/3430 cut-off events. [2025-03-14 01:42:14,290 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:42:14,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 3430 events. 102/3430 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 31184 event pairs, 51 based on Foata normal form. 0/2582 useless extension candidates. Maximal degree in co-relation 3544. Up to 144 conditions per place. [2025-03-14 01:42:14,349 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 15 selfloop transitions, 2 changer transitions 0/512 dead transitions. [2025-03-14 01:42:14,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 512 transitions, 1070 flow [2025-03-14 01:42:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1581 transitions. [2025-03-14 01:42:14,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9634369287020109 [2025-03-14 01:42:14,354 INFO L175 Difference]: Start difference. First operand has 513 places, 513 transitions, 1038 flow. Second operand 3 states and 1581 transitions. [2025-03-14 01:42:14,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 512 transitions, 1070 flow [2025-03-14 01:42:14,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 512 transitions, 1066 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:14,365 INFO L231 Difference]: Finished difference. Result has 512 places, 512 transitions, 1036 flow [2025-03-14 01:42:14,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=512, PETRI_TRANSITIONS=512} [2025-03-14 01:42:14,367 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -12 predicate places. [2025-03-14 01:42:14,367 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 512 transitions, 1036 flow [2025-03-14 01:42:14,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 522.3333333333334) internal successors, (1567), 3 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:14,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:14,369 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] [2025-03-14 01:42:14,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:42:14,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:14,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:14,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1700320514, now seen corresponding path program 1 times [2025-03-14 01:42:14,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:14,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549490945] [2025-03-14 01:42:14,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:14,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:42:14,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:42:14,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:14,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:14,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:14,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549490945] [2025-03-14 01:42:14,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549490945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:14,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:14,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:14,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932324112] [2025-03-14 01:42:14,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:14,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:14,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:14,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:14,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 547 [2025-03-14 01:42:14,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 512 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:14,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:14,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 547 [2025-03-14 01:42:14,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:14,698 INFO L124 PetriNetUnfolderBase]: 121/846 cut-off events. [2025-03-14 01:42:14,698 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:42:14,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 846 events. 121/846 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4947 event pairs, 90 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 1186. Up to 228 conditions per place. [2025-03-14 01:42:14,731 INFO L140 encePairwiseOnDemand]: 514/547 looper letters, 41 selfloop transitions, 15 changer transitions 0/498 dead transitions. [2025-03-14 01:42:14,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 498 transitions, 1123 flow [2025-03-14 01:42:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-03-14 01:42:14,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9043266301035954 [2025-03-14 01:42:14,736 INFO L175 Difference]: Start difference. First operand has 512 places, 512 transitions, 1036 flow. Second operand 3 states and 1484 transitions. [2025-03-14 01:42:14,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 498 transitions, 1123 flow [2025-03-14 01:42:14,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 498 transitions, 1119 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:14,748 INFO L231 Difference]: Finished difference. Result has 495 places, 495 transitions, 1045 flow [2025-03-14 01:42:14,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=495, PETRI_TRANSITIONS=495} [2025-03-14 01:42:14,750 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -29 predicate places. [2025-03-14 01:42:14,750 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 495 transitions, 1045 flow [2025-03-14 01:42:14,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:14,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:14,751 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] [2025-03-14 01:42:14,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:42:14,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:14,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1920408975, now seen corresponding path program 1 times [2025-03-14 01:42:14,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:14,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73071222] [2025-03-14 01:42:14,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:14,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:14,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-14 01:42:14,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 01:42:14,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:14,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:14,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73071222] [2025-03-14 01:42:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73071222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:14,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:14,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908370131] [2025-03-14 01:42:14,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:14,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:14,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:14,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:14,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 547 [2025-03-14 01:42:14,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 495 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:14,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:14,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 547 [2025-03-14 01:42:14,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:15,065 INFO L124 PetriNetUnfolderBase]: 121/830 cut-off events. [2025-03-14 01:42:15,065 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-14 01:42:15,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 830 events. 121/830 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4969 event pairs, 90 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 1066. Up to 226 conditions per place. [2025-03-14 01:42:15,082 INFO L140 encePairwiseOnDemand]: 515/547 looper letters, 39 selfloop transitions, 15 changer transitions 0/482 dead transitions. [2025-03-14 01:42:15,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 482 transitions, 1130 flow [2025-03-14 01:42:15,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1490 transitions. [2025-03-14 01:42:15,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079829372333943 [2025-03-14 01:42:15,085 INFO L175 Difference]: Start difference. First operand has 495 places, 495 transitions, 1045 flow. Second operand 3 states and 1490 transitions. [2025-03-14 01:42:15,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 482 transitions, 1130 flow [2025-03-14 01:42:15,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 482 transitions, 1115 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:15,092 INFO L231 Difference]: Finished difference. Result has 480 places, 479 transitions, 1045 flow [2025-03-14 01:42:15,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=480, PETRI_TRANSITIONS=479} [2025-03-14 01:42:15,094 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -44 predicate places. [2025-03-14 01:42:15,094 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 479 transitions, 1045 flow [2025-03-14 01:42:15,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:15,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:15,095 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] [2025-03-14 01:42:15,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:42:15,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:15,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash -811502008, now seen corresponding path program 1 times [2025-03-14 01:42:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:15,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113835857] [2025-03-14 01:42:15,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:15,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-14 01:42:15,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-14 01:42:15,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:15,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:15,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:15,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113835857] [2025-03-14 01:42:15,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113835857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:15,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:15,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:15,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908744898] [2025-03-14 01:42:15,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:15,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:15,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:15,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:15,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:15,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 547 [2025-03-14 01:42:15,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 479 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:15,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:15,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 547 [2025-03-14 01:42:15,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:15,436 INFO L124 PetriNetUnfolderBase]: 128/1092 cut-off events. [2025-03-14 01:42:15,437 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-14 01:42:15,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 1092 events. 128/1092 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6967 event pairs, 21 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1271. Up to 232 conditions per place. [2025-03-14 01:42:15,462 INFO L140 encePairwiseOnDemand]: 513/547 looper letters, 44 selfloop transitions, 16 changer transitions 0/469 dead transitions. [2025-03-14 01:42:15,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 469 transitions, 1151 flow [2025-03-14 01:42:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1488 transitions. [2025-03-14 01:42:15,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.906764168190128 [2025-03-14 01:42:15,469 INFO L175 Difference]: Start difference. First operand has 480 places, 479 transitions, 1045 flow. Second operand 3 states and 1488 transitions. [2025-03-14 01:42:15,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 469 transitions, 1151 flow [2025-03-14 01:42:15,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 469 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:15,476 INFO L231 Difference]: Finished difference. Result has 464 places, 463 transitions, 1050 flow [2025-03-14 01:42:15,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1050, PETRI_PLACES=464, PETRI_TRANSITIONS=463} [2025-03-14 01:42:15,479 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -60 predicate places. [2025-03-14 01:42:15,479 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 463 transitions, 1050 flow [2025-03-14 01:42:15,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:15,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:15,480 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] [2025-03-14 01:42:15,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:42:15,480 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:15,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1830650305, now seen corresponding path program 1 times [2025-03-14 01:42:15,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:15,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336788126] [2025-03-14 01:42:15,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:15,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:15,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-14 01:42:15,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-14 01:42:15,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:15,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:15,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336788126] [2025-03-14 01:42:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336788126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:15,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:15,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:42:15,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011927379] [2025-03-14 01:42:15,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:15,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:42:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:15,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:42:15,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:42:15,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 520 out of 547 [2025-03-14 01:42:15,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 463 transitions, 1050 flow. Second operand has 4 states, 4 states have (on average 521.25) internal successors, (2085), 4 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:15,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:15,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 520 of 547 [2025-03-14 01:42:15,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:15,702 INFO L124 PetriNetUnfolderBase]: 12/791 cut-off events. [2025-03-14 01:42:15,702 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-14 01:42:15,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 791 events. 12/791 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3639 event pairs, 0 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 657. Up to 26 conditions per place. [2025-03-14 01:42:15,714 INFO L140 encePairwiseOnDemand]: 541/547 looper letters, 19 selfloop transitions, 5 changer transitions 0/468 dead transitions. [2025-03-14 01:42:15,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 468 transitions, 1108 flow [2025-03-14 01:42:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:42:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:42:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2625 transitions. [2025-03-14 01:42:15,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9597806215722121 [2025-03-14 01:42:15,720 INFO L175 Difference]: Start difference. First operand has 464 places, 463 transitions, 1050 flow. Second operand 5 states and 2625 transitions. [2025-03-14 01:42:15,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 468 transitions, 1108 flow [2025-03-14 01:42:15,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 468 transitions, 1092 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:15,728 INFO L231 Difference]: Finished difference. Result has 471 places, 467 transitions, 1072 flow [2025-03-14 01:42:15,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1072, PETRI_PLACES=471, PETRI_TRANSITIONS=467} [2025-03-14 01:42:15,730 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -53 predicate places. [2025-03-14 01:42:15,730 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 467 transitions, 1072 flow [2025-03-14 01:42:15,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 521.25) internal successors, (2085), 4 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:15,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:15,731 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] [2025-03-14 01:42:15,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:42:15,731 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:15,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1924143831, now seen corresponding path program 1 times [2025-03-14 01:42:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:15,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069955635] [2025-03-14 01:42:15,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:15,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-14 01:42:15,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-14 01:42:15,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:15,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:15,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:15,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069955635] [2025-03-14 01:42:15,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069955635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:15,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:15,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:15,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836871749] [2025-03-14 01:42:15,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:15,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:15,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:15,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:15,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:15,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 547 [2025-03-14 01:42:15,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 467 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:15,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:15,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 547 [2025-03-14 01:42:15,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:16,080 INFO L124 PetriNetUnfolderBase]: 208/1557 cut-off events. [2025-03-14 01:42:16,080 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-14 01:42:16,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 1557 events. 208/1557 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11652 event pairs, 35 based on Foata normal form. 1/1441 useless extension candidates. Maximal degree in co-relation 1733. Up to 380 conditions per place. [2025-03-14 01:42:16,106 INFO L140 encePairwiseOnDemand]: 515/547 looper letters, 40 selfloop transitions, 15 changer transitions 10/458 dead transitions. [2025-03-14 01:42:16,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 458 transitions, 1175 flow [2025-03-14 01:42:16,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1493 transitions. [2025-03-14 01:42:16,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098110907982937 [2025-03-14 01:42:16,109 INFO L175 Difference]: Start difference. First operand has 471 places, 467 transitions, 1072 flow. Second operand 3 states and 1493 transitions. [2025-03-14 01:42:16,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 458 transitions, 1175 flow [2025-03-14 01:42:16,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 458 transitions, 1175 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:16,115 INFO L231 Difference]: Finished difference. Result has 457 places, 441 transitions, 1066 flow [2025-03-14 01:42:16,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=457, PETRI_TRANSITIONS=441} [2025-03-14 01:42:16,116 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -67 predicate places. [2025-03-14 01:42:16,116 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 441 transitions, 1066 flow [2025-03-14 01:42:16,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:16,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:16,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:16,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:42:16,117 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:16,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1112923681, now seen corresponding path program 1 times [2025-03-14 01:42:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:16,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510398535] [2025-03-14 01:42:16,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:16,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-14 01:42:16,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-14 01:42:16,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:16,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:16,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:16,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510398535] [2025-03-14 01:42:16,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510398535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:16,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:16,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:16,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765751348] [2025-03-14 01:42:16,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:16,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:16,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:16,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:16,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 519 out of 547 [2025-03-14 01:42:16,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 441 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 520.3333333333334) internal successors, (1561), 3 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:16,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:16,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 519 of 547 [2025-03-14 01:42:16,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:18,037 INFO L124 PetriNetUnfolderBase]: 751/14488 cut-off events. [2025-03-14 01:42:18,038 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2025-03-14 01:42:18,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18474 conditions, 14488 events. 751/14488 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 189595 event pairs, 349 based on Foata normal form. 0/12922 useless extension candidates. Maximal degree in co-relation 14026. Up to 1015 conditions per place. [2025-03-14 01:42:18,155 INFO L140 encePairwiseOnDemand]: 539/547 looper letters, 19 selfloop transitions, 4 changer transitions 0/444 dead transitions. [2025-03-14 01:42:18,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 444 transitions, 1121 flow [2025-03-14 01:42:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1584 transitions. [2025-03-14 01:42:18,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652650822669104 [2025-03-14 01:42:18,158 INFO L175 Difference]: Start difference. First operand has 457 places, 441 transitions, 1066 flow. Second operand 3 states and 1584 transitions. [2025-03-14 01:42:18,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 444 transitions, 1121 flow [2025-03-14 01:42:18,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 444 transitions, 1106 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:18,172 INFO L231 Difference]: Finished difference. Result has 445 places, 441 transitions, 1071 flow [2025-03-14 01:42:18,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1071, PETRI_PLACES=445, PETRI_TRANSITIONS=441} [2025-03-14 01:42:18,173 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -79 predicate places. [2025-03-14 01:42:18,173 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 441 transitions, 1071 flow [2025-03-14 01:42:18,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 520.3333333333334) internal successors, (1561), 3 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:18,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:18,174 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:42:18,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:42:18,174 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:18,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash -134299826, now seen corresponding path program 1 times [2025-03-14 01:42:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:18,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143561132] [2025-03-14 01:42:18,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:18,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:18,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-14 01:42:18,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:42:18,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:18,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:18,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143561132] [2025-03-14 01:42:18,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143561132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:18,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:18,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:18,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6364699] [2025-03-14 01:42:18,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:18,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:18,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:18,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:18,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:18,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:18,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 441 transitions, 1071 flow. Second operand has 3 states, 3 states have (on average 505.0) internal successors, (1515), 3 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:18,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:18,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:18,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:18,933 INFO L124 PetriNetUnfolderBase]: 365/4355 cut-off events. [2025-03-14 01:42:18,933 INFO L125 PetriNetUnfolderBase]: For 167/179 co-relation queries the response was YES. [2025-03-14 01:42:18,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6095 conditions, 4355 events. 365/4355 cut-off events. For 167/179 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 42914 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 4185. Up to 528 conditions per place. [2025-03-14 01:42:18,992 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-03-14 01:42:18,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 443 transitions, 1156 flow [2025-03-14 01:42:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:18,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:18,994 INFO L175 Difference]: Start difference. First operand has 445 places, 441 transitions, 1071 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:18,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 443 transitions, 1156 flow [2025-03-14 01:42:18,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 443 transitions, 1156 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:19,001 INFO L231 Difference]: Finished difference. Result has 446 places, 440 transitions, 1073 flow [2025-03-14 01:42:19,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=446, PETRI_TRANSITIONS=440} [2025-03-14 01:42:19,002 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -78 predicate places. [2025-03-14 01:42:19,002 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 440 transitions, 1073 flow [2025-03-14 01:42:19,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 505.0) internal successors, (1515), 3 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:19,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:19,003 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:42:19,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:42:19,003 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:19,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash 895529178, now seen corresponding path program 1 times [2025-03-14 01:42:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-03-14 01:42:19,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:19,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-14 01:42:19,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:42:19,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:19,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:19,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:19,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-03-14 01:42:19,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055825286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:19,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:19,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393319804] [2025-03-14 01:42:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:19,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:19,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:19,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:19,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:19,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 440 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:19,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:19,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:19,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:20,189 INFO L124 PetriNetUnfolderBase]: 742/5750 cut-off events. [2025-03-14 01:42:20,189 INFO L125 PetriNetUnfolderBase]: For 670/678 co-relation queries the response was YES. [2025-03-14 01:42:20,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8890 conditions, 5750 events. 742/5750 cut-off events. For 670/678 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 60918 event pairs, 545 based on Foata normal form. 0/5227 useless extension candidates. Maximal degree in co-relation 8581. Up to 1441 conditions per place. [2025-03-14 01:42:20,279 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/442 dead transitions. [2025-03-14 01:42:20,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 442 transitions, 1156 flow [2025-03-14 01:42:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:20,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:20,281 INFO L175 Difference]: Start difference. First operand has 446 places, 440 transitions, 1073 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:20,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 442 transitions, 1156 flow [2025-03-14 01:42:20,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 442 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:20,290 INFO L231 Difference]: Finished difference. Result has 445 places, 439 transitions, 1071 flow [2025-03-14 01:42:20,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1071, PETRI_PLACES=445, PETRI_TRANSITIONS=439} [2025-03-14 01:42:20,291 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -79 predicate places. [2025-03-14 01:42:20,291 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 439 transitions, 1071 flow [2025-03-14 01:42:20,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:20,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:20,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:20,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:42:20,292 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:20,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1834530354, now seen corresponding path program 1 times [2025-03-14 01:42:20,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:20,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872907837] [2025-03-14 01:42:20,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:20,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:42:20,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:42:20,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:20,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872907837] [2025-03-14 01:42:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872907837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:20,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:20,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:20,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080759684] [2025-03-14 01:42:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:20,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:20,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:20,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:20,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:20,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:20,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 439 transitions, 1071 flow. Second operand has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:20,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:20,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:20,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:21,355 INFO L124 PetriNetUnfolderBase]: 365/4331 cut-off events. [2025-03-14 01:42:21,355 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2025-03-14 01:42:21,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6096 conditions, 4331 events. 365/4331 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42644 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5064. Up to 528 conditions per place. [2025-03-14 01:42:21,444 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/441 dead transitions. [2025-03-14 01:42:21,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 441 transitions, 1156 flow [2025-03-14 01:42:21,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:21,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:21,447 INFO L175 Difference]: Start difference. First operand has 445 places, 439 transitions, 1071 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:21,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 441 transitions, 1156 flow [2025-03-14 01:42:21,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 441 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:21,457 INFO L231 Difference]: Finished difference. Result has 444 places, 438 transitions, 1069 flow [2025-03-14 01:42:21,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1069, PETRI_PLACES=444, PETRI_TRANSITIONS=438} [2025-03-14 01:42:21,458 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -80 predicate places. [2025-03-14 01:42:21,458 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 438 transitions, 1069 flow [2025-03-14 01:42:21,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:21,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:21,459 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] [2025-03-14 01:42:21,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:42:21,459 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:21,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1735183959, now seen corresponding path program 1 times [2025-03-14 01:42:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:21,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927850716] [2025-03-14 01:42:21,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:21,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-14 01:42:21,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-14 01:42:21,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:21,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:21,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927850716] [2025-03-14 01:42:21,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927850716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:21,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:21,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028822765] [2025-03-14 01:42:21,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:21,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:21,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:21,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:21,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:21,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:21,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 438 transitions, 1069 flow. Second operand has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:21,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:21,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:21,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:22,473 INFO L124 PetriNetUnfolderBase]: 412/4330 cut-off events. [2025-03-14 01:42:22,474 INFO L125 PetriNetUnfolderBase]: For 414/417 co-relation queries the response was YES. [2025-03-14 01:42:22,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6108 conditions, 4330 events. 412/4330 cut-off events. For 414/417 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 42788 event pairs, 268 based on Foata normal form. 0/3928 useless extension candidates. Maximal degree in co-relation 5849. Up to 692 conditions per place. [2025-03-14 01:42:22,551 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/440 dead transitions. [2025-03-14 01:42:22,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1156 flow [2025-03-14 01:42:22,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:22,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:22,554 INFO L175 Difference]: Start difference. First operand has 444 places, 438 transitions, 1069 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:22,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1156 flow [2025-03-14 01:42:22,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 440 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:22,563 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 1067 flow [2025-03-14 01:42:22,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1067, PETRI_PLACES=443, PETRI_TRANSITIONS=437} [2025-03-14 01:42:22,564 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -81 predicate places. [2025-03-14 01:42:22,564 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 1067 flow [2025-03-14 01:42:22,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:22,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:22,566 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] [2025-03-14 01:42:22,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:42:22,566 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:22,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1681512926, now seen corresponding path program 1 times [2025-03-14 01:42:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:22,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150449236] [2025-03-14 01:42:22,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:22,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:22,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-14 01:42:22,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-14 01:42:22,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:22,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150449236] [2025-03-14 01:42:22,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150449236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:22,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:22,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:22,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374555872] [2025-03-14 01:42:22,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:22,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:22,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:22,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:22,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:22,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 437 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:22,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:22,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:22,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:23,713 INFO L124 PetriNetUnfolderBase]: 754/5924 cut-off events. [2025-03-14 01:42:23,713 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-14 01:42:23,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9132 conditions, 5924 events. 754/5924 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 62804 event pairs, 545 based on Foata normal form. 0/5424 useless extension candidates. Maximal degree in co-relation 8260. Up to 1441 conditions per place. [2025-03-14 01:42:23,962 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/439 dead transitions. [2025-03-14 01:42:23,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 439 transitions, 1150 flow [2025-03-14 01:42:23,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:23,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:23,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:23,965 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 1067 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:23,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 439 transitions, 1150 flow [2025-03-14 01:42:23,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 439 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:23,972 INFO L231 Difference]: Finished difference. Result has 442 places, 436 transitions, 1065 flow [2025-03-14 01:42:23,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1065, PETRI_PLACES=442, PETRI_TRANSITIONS=436} [2025-03-14 01:42:23,973 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -82 predicate places. [2025-03-14 01:42:23,973 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 436 transitions, 1065 flow [2025-03-14 01:42:23,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:23,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:23,974 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] [2025-03-14 01:42:23,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:42:23,974 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread4Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:23,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:23,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1491525353, now seen corresponding path program 1 times [2025-03-14 01:42:23,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:23,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000384303] [2025-03-14 01:42:23,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:23,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-14 01:42:23,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-14 01:42:23,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:23,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:24,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000384303] [2025-03-14 01:42:24,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000384303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:24,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:24,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:24,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264633052] [2025-03-14 01:42:24,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:24,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:24,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:24,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:24,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:24,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:24,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 436 transitions, 1065 flow. Second operand has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:24,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:24,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:24,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:24,612 INFO L124 PetriNetUnfolderBase]: 235/3321 cut-off events. [2025-03-14 01:42:24,612 INFO L125 PetriNetUnfolderBase]: For 290/297 co-relation queries the response was YES. [2025-03-14 01:42:24,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4517 conditions, 3321 events. 235/3321 cut-off events. For 290/297 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 30178 event pairs, 129 based on Foata normal form. 1/3029 useless extension candidates. Maximal degree in co-relation 3627. Up to 389 conditions per place. [2025-03-14 01:42:24,672 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/438 dead transitions. [2025-03-14 01:42:24,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 438 transitions, 1148 flow [2025-03-14 01:42:24,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:24,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:24,674 INFO L175 Difference]: Start difference. First operand has 442 places, 436 transitions, 1065 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:24,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 438 transitions, 1148 flow [2025-03-14 01:42:24,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 438 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:24,681 INFO L231 Difference]: Finished difference. Result has 441 places, 435 transitions, 1063 flow [2025-03-14 01:42:24,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1063, PETRI_PLACES=441, PETRI_TRANSITIONS=435} [2025-03-14 01:42:24,682 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -83 predicate places. [2025-03-14 01:42:24,682 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 435 transitions, 1063 flow [2025-03-14 01:42:24,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:24,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:24,683 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] [2025-03-14 01:42:24,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:42:24,683 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:24,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1838577318, now seen corresponding path program 1 times [2025-03-14 01:42:24,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:24,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096282750] [2025-03-14 01:42:24,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:24,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-14 01:42:24,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-14 01:42:24,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:24,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:24,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:24,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096282750] [2025-03-14 01:42:24,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096282750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:24,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:24,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:24,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057767753] [2025-03-14 01:42:24,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:24,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:24,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:24,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:24,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:24,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:24,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 435 transitions, 1063 flow. Second operand has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:24,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:24,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:24,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:25,445 INFO L124 PetriNetUnfolderBase]: 365/4283 cut-off events. [2025-03-14 01:42:25,446 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-14 01:42:25,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6046 conditions, 4283 events. 365/4283 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 41972 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5119. Up to 528 conditions per place. [2025-03-14 01:42:25,526 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2025-03-14 01:42:25,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 437 transitions, 1148 flow [2025-03-14 01:42:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:25,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:25,528 INFO L175 Difference]: Start difference. First operand has 441 places, 435 transitions, 1063 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:25,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 437 transitions, 1148 flow [2025-03-14 01:42:25,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 437 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:25,536 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 1061 flow [2025-03-14 01:42:25,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2025-03-14 01:42:25,537 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -84 predicate places. [2025-03-14 01:42:25,537 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 1061 flow [2025-03-14 01:42:25,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:25,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:25,538 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] [2025-03-14 01:42:25,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:42:25,538 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:25,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1633765979, now seen corresponding path program 1 times [2025-03-14 01:42:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:25,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657802514] [2025-03-14 01:42:25,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:25,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-14 01:42:25,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-14 01:42:25,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:25,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:25,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:25,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657802514] [2025-03-14 01:42:25,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657802514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:25,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:25,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:25,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758504735] [2025-03-14 01:42:25,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:25,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:25,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:25,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:25,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:25,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:25,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:25,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:25,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:25,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:26,389 INFO L124 PetriNetUnfolderBase]: 412/4270 cut-off events. [2025-03-14 01:42:26,389 INFO L125 PetriNetUnfolderBase]: For 411/414 co-relation queries the response was YES. [2025-03-14 01:42:26,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6048 conditions, 4270 events. 412/4270 cut-off events. For 411/414 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 41799 event pairs, 268 based on Foata normal form. 0/3916 useless extension candidates. Maximal degree in co-relation 5825. Up to 692 conditions per place. [2025-03-14 01:42:26,469 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-03-14 01:42:26,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 436 transitions, 1148 flow [2025-03-14 01:42:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:26,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:26,471 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 1061 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:26,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 436 transitions, 1148 flow [2025-03-14 01:42:26,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 436 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:26,477 INFO L231 Difference]: Finished difference. Result has 439 places, 433 transitions, 1059 flow [2025-03-14 01:42:26,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1059, PETRI_PLACES=439, PETRI_TRANSITIONS=433} [2025-03-14 01:42:26,478 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -85 predicate places. [2025-03-14 01:42:26,478 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 433 transitions, 1059 flow [2025-03-14 01:42:26,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:26,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:26,479 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] [2025-03-14 01:42:26,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:42:26,479 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:26,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1041439718, now seen corresponding path program 1 times [2025-03-14 01:42:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487449905] [2025-03-14 01:42:26,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:26,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-14 01:42:26,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-14 01:42:26,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:26,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:26,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:26,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487449905] [2025-03-14 01:42:26,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487449905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:26,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:26,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:26,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319176392] [2025-03-14 01:42:26,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:26,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:26,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:26,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:26,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:26,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:26,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 433 transitions, 1059 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:26,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:26,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:26,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:27,557 INFO L124 PetriNetUnfolderBase]: 766/6081 cut-off events. [2025-03-14 01:42:27,558 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-14 01:42:27,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9343 conditions, 6081 events. 766/6081 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 64307 event pairs, 545 based on Foata normal form. 0/5619 useless extension candidates. Maximal degree in co-relation 8585. Up to 1441 conditions per place. [2025-03-14 01:42:27,646 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-03-14 01:42:27,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1142 flow [2025-03-14 01:42:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:27,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:27,649 INFO L175 Difference]: Start difference. First operand has 439 places, 433 transitions, 1059 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:27,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1142 flow [2025-03-14 01:42:27,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 435 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:27,655 INFO L231 Difference]: Finished difference. Result has 438 places, 432 transitions, 1057 flow [2025-03-14 01:42:27,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=438, PETRI_TRANSITIONS=432} [2025-03-14 01:42:27,655 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -86 predicate places. [2025-03-14 01:42:27,655 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 432 transitions, 1057 flow [2025-03-14 01:42:27,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:27,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:27,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:27,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:42:27,656 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread4Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:27,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1391396429, now seen corresponding path program 1 times [2025-03-14 01:42:27,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:27,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411652019] [2025-03-14 01:42:27,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:27,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-14 01:42:27,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:42:27,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:27,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:27,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:27,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411652019] [2025-03-14 01:42:27,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411652019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:27,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:27,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:27,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392087098] [2025-03-14 01:42:27,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:27,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:27,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:27,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:27,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:27,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:27,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 432 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 507.6666666666667) internal successors, (1523), 3 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:27,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:27,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:27,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:28,219 INFO L124 PetriNetUnfolderBase]: 235/3319 cut-off events. [2025-03-14 01:42:28,220 INFO L125 PetriNetUnfolderBase]: For 290/294 co-relation queries the response was YES. [2025-03-14 01:42:28,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4515 conditions, 3319 events. 235/3319 cut-off events. For 290/294 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 30065 event pairs, 129 based on Foata normal form. 0/3058 useless extension candidates. Maximal degree in co-relation 3632. Up to 389 conditions per place. [2025-03-14 01:42:28,272 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-03-14 01:42:28,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 434 transitions, 1140 flow [2025-03-14 01:42:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:28,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:28,275 INFO L175 Difference]: Start difference. First operand has 438 places, 432 transitions, 1057 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:28,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 434 transitions, 1140 flow [2025-03-14 01:42:28,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 434 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:28,281 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 1055 flow [2025-03-14 01:42:28,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1055, PETRI_PLACES=437, PETRI_TRANSITIONS=431} [2025-03-14 01:42:28,282 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -87 predicate places. [2025-03-14 01:42:28,282 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 1055 flow [2025-03-14 01:42:28,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.6666666666667) internal successors, (1523), 3 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:28,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:28,283 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] [2025-03-14 01:42:28,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:42:28,283 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:28,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:28,283 INFO L85 PathProgramCache]: Analyzing trace with hash 966721882, now seen corresponding path program 1 times [2025-03-14 01:42:28,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:28,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053704491] [2025-03-14 01:42:28,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:28,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:28,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-14 01:42:28,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:42:28,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:28,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053704491] [2025-03-14 01:42:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053704491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:28,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58506216] [2025-03-14 01:42:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:28,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:28,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:28,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:28,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:28,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 431 transitions, 1055 flow. Second operand has 3 states, 3 states have (on average 508.0) internal successors, (1524), 3 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:28,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:28,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:28,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:29,112 INFO L124 PetriNetUnfolderBase]: 365/4235 cut-off events. [2025-03-14 01:42:29,112 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-14 01:42:29,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5998 conditions, 4235 events. 365/4235 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 41316 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5203. Up to 528 conditions per place. [2025-03-14 01:42:29,170 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-03-14 01:42:29,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 433 transitions, 1140 flow [2025-03-14 01:42:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:29,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:29,173 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 1055 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:29,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 433 transitions, 1140 flow [2025-03-14 01:42:29,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 433 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:29,180 INFO L231 Difference]: Finished difference. Result has 436 places, 430 transitions, 1053 flow [2025-03-14 01:42:29,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1053, PETRI_PLACES=436, PETRI_TRANSITIONS=430} [2025-03-14 01:42:29,180 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -88 predicate places. [2025-03-14 01:42:29,180 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 430 transitions, 1053 flow [2025-03-14 01:42:29,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.0) internal successors, (1524), 3 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:29,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:29,181 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] [2025-03-14 01:42:29,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:42:29,181 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:29,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash 62398499, now seen corresponding path program 1 times [2025-03-14 01:42:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:29,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572024897] [2025-03-14 01:42:29,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:29,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-14 01:42:29,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-14 01:42:29,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:29,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:29,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:29,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572024897] [2025-03-14 01:42:29,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572024897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:29,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:29,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:29,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291153726] [2025-03-14 01:42:29,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:29,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:29,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:29,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:29,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:29,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 430 transitions, 1053 flow. Second operand has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:29,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:29,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:29,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:30,203 INFO L124 PetriNetUnfolderBase]: 412/4210 cut-off events. [2025-03-14 01:42:30,203 INFO L125 PetriNetUnfolderBase]: For 408/411 co-relation queries the response was YES. [2025-03-14 01:42:30,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5988 conditions, 4210 events. 412/4210 cut-off events. For 408/411 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 41013 event pairs, 268 based on Foata normal form. 0/3904 useless extension candidates. Maximal degree in co-relation 5801. Up to 692 conditions per place. [2025-03-14 01:42:30,285 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2025-03-14 01:42:30,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 432 transitions, 1140 flow [2025-03-14 01:42:30,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:30,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:30,288 INFO L175 Difference]: Start difference. First operand has 436 places, 430 transitions, 1053 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:30,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 432 transitions, 1140 flow [2025-03-14 01:42:30,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 432 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:30,295 INFO L231 Difference]: Finished difference. Result has 435 places, 429 transitions, 1051 flow [2025-03-14 01:42:30,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1051, PETRI_PLACES=435, PETRI_TRANSITIONS=429} [2025-03-14 01:42:30,296 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -89 predicate places. [2025-03-14 01:42:30,296 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 429 transitions, 1051 flow [2025-03-14 01:42:30,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:30,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:30,296 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] [2025-03-14 01:42:30,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:42:30,296 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:30,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:30,297 INFO L85 PathProgramCache]: Analyzing trace with hash 612064430, now seen corresponding path program 1 times [2025-03-14 01:42:30,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:30,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419465313] [2025-03-14 01:42:30,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:30,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:30,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-14 01:42:30,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-14 01:42:30,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:30,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419465313] [2025-03-14 01:42:30,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419465313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:30,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:30,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:30,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127436292] [2025-03-14 01:42:30,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:30,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:30,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:30,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:30,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:30,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:30,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 429 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:30,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:30,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:30,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:31,701 INFO L124 PetriNetUnfolderBase]: 778/6232 cut-off events. [2025-03-14 01:42:31,701 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-14 01:42:31,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9548 conditions, 6232 events. 778/6232 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 65414 event pairs, 545 based on Foata normal form. 0/5814 useless extension candidates. Maximal degree in co-relation 8904. Up to 1441 conditions per place. [2025-03-14 01:42:31,850 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/431 dead transitions. [2025-03-14 01:42:31,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 431 transitions, 1134 flow [2025-03-14 01:42:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:31,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:31,854 INFO L175 Difference]: Start difference. First operand has 435 places, 429 transitions, 1051 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:31,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 431 transitions, 1134 flow [2025-03-14 01:42:31,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 431 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:31,862 INFO L231 Difference]: Finished difference. Result has 434 places, 428 transitions, 1049 flow [2025-03-14 01:42:31,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=428} [2025-03-14 01:42:31,863 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -90 predicate places. [2025-03-14 01:42:31,863 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 428 transitions, 1049 flow [2025-03-14 01:42:31,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:31,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:31,864 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] [2025-03-14 01:42:31,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:42:31,864 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread4Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:31,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash 21912629, now seen corresponding path program 1 times [2025-03-14 01:42:31,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:31,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-14 01:42:31,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:31,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-14 01:42:31,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-14 01:42:31,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:31,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:31,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-14 01:42:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967039731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:31,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:31,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:31,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426235210] [2025-03-14 01:42:31,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:31,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:31,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:31,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:31,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:31,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:31,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 428 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 508.6666666666667) internal successors, (1526), 3 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:31,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:31,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:31,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:32,475 INFO L124 PetriNetUnfolderBase]: 235/3275 cut-off events. [2025-03-14 01:42:32,476 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-14 01:42:32,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 3275 events. 235/3275 cut-off events. For 289/293 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 29549 event pairs, 129 based on Foata normal form. 0/3052 useless extension candidates. Maximal degree in co-relation 3656. Up to 389 conditions per place. [2025-03-14 01:42:32,519 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/430 dead transitions. [2025-03-14 01:42:32,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 430 transitions, 1132 flow [2025-03-14 01:42:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:32,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:32,521 INFO L175 Difference]: Start difference. First operand has 434 places, 428 transitions, 1049 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:32,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 430 transitions, 1132 flow [2025-03-14 01:42:32,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 430 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:32,527 INFO L231 Difference]: Finished difference. Result has 433 places, 427 transitions, 1047 flow [2025-03-14 01:42:32,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1047, PETRI_PLACES=433, PETRI_TRANSITIONS=427} [2025-03-14 01:42:32,528 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -91 predicate places. [2025-03-14 01:42:32,528 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 427 transitions, 1047 flow [2025-03-14 01:42:32,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.6666666666667) internal successors, (1526), 3 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:32,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:32,529 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] [2025-03-14 01:42:32,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 01:42:32,529 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:32,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:32,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1396210842, now seen corresponding path program 1 times [2025-03-14 01:42:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:32,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946596198] [2025-03-14 01:42:32,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:32,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:32,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-14 01:42:32,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-14 01:42:32,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:32,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:32,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:32,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946596198] [2025-03-14 01:42:32,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946596198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:32,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:32,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:32,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630937135] [2025-03-14 01:42:32,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:32,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:32,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:32,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:32,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:32,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:32,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 427 transitions, 1047 flow. Second operand has 3 states, 3 states have (on average 509.0) internal successors, (1527), 3 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:32,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:32,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:32,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:33,226 INFO L124 PetriNetUnfolderBase]: 365/4187 cut-off events. [2025-03-14 01:42:33,227 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-14 01:42:33,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5950 conditions, 4187 events. 365/4187 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 40641 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5287. Up to 528 conditions per place. [2025-03-14 01:42:33,292 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2025-03-14 01:42:33,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 429 transitions, 1132 flow [2025-03-14 01:42:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:33,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:33,294 INFO L175 Difference]: Start difference. First operand has 433 places, 427 transitions, 1047 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:33,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 429 transitions, 1132 flow [2025-03-14 01:42:33,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 429 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:33,301 INFO L231 Difference]: Finished difference. Result has 432 places, 426 transitions, 1045 flow [2025-03-14 01:42:33,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=432, PETRI_TRANSITIONS=426} [2025-03-14 01:42:33,301 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -92 predicate places. [2025-03-14 01:42:33,301 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 426 transitions, 1045 flow [2025-03-14 01:42:33,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.0) internal successors, (1527), 3 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:33,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:33,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:33,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 01:42:33,302 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:33,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1366465905, now seen corresponding path program 1 times [2025-03-14 01:42:33,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:33,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126435571] [2025-03-14 01:42:33,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:33,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:33,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-14 01:42:33,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-14 01:42:33,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:33,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:33,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126435571] [2025-03-14 01:42:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126435571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:33,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280709694] [2025-03-14 01:42:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:33,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:33,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:33,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:33,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:33,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 426 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:33,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:33,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:33,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:34,027 INFO L124 PetriNetUnfolderBase]: 412/4150 cut-off events. [2025-03-14 01:42:34,028 INFO L125 PetriNetUnfolderBase]: For 405/408 co-relation queries the response was YES. [2025-03-14 01:42:34,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5928 conditions, 4150 events. 412/4150 cut-off events. For 405/408 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 40114 event pairs, 268 based on Foata normal form. 0/3892 useless extension candidates. Maximal degree in co-relation 5777. Up to 692 conditions per place. [2025-03-14 01:42:34,103 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2025-03-14 01:42:34,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 428 transitions, 1132 flow [2025-03-14 01:42:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:34,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:34,105 INFO L175 Difference]: Start difference. First operand has 432 places, 426 transitions, 1045 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:34,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 428 transitions, 1132 flow [2025-03-14 01:42:34,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 428 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:34,111 INFO L231 Difference]: Finished difference. Result has 431 places, 425 transitions, 1043 flow [2025-03-14 01:42:34,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=431, PETRI_TRANSITIONS=425} [2025-03-14 01:42:34,112 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -93 predicate places. [2025-03-14 01:42:34,112 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 425 transitions, 1043 flow [2025-03-14 01:42:34,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:34,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:34,113 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] [2025-03-14 01:42:34,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 01:42:34,113 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:34,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1972209934, now seen corresponding path program 1 times [2025-03-14 01:42:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347691737] [2025-03-14 01:42:34,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:34,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:34,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-14 01:42:34,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-14 01:42:34,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:34,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347691737] [2025-03-14 01:42:34,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347691737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:34,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:34,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551563904] [2025-03-14 01:42:34,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:34,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:34,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:34,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:34,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:34,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 425 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:34,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:34,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:34,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:35,305 INFO L124 PetriNetUnfolderBase]: 790/6377 cut-off events. [2025-03-14 01:42:35,305 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-14 01:42:35,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9747 conditions, 6377 events. 790/6377 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 66223 event pairs, 545 based on Foata normal form. 0/6012 useless extension candidates. Maximal degree in co-relation 9217. Up to 1441 conditions per place. [2025-03-14 01:42:35,396 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2025-03-14 01:42:35,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 427 transitions, 1126 flow [2025-03-14 01:42:35,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:35,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:35,398 INFO L175 Difference]: Start difference. First operand has 431 places, 425 transitions, 1043 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:35,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 427 transitions, 1126 flow [2025-03-14 01:42:35,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 427 transitions, 1122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:35,405 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 1041 flow [2025-03-14 01:42:35,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1041, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2025-03-14 01:42:35,405 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -94 predicate places. [2025-03-14 01:42:35,405 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 1041 flow [2025-03-14 01:42:35,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:35,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:35,406 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] [2025-03-14 01:42:35,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 01:42:35,406 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread4Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:35,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1375623681, now seen corresponding path program 1 times [2025-03-14 01:42:35,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:35,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314962220] [2025-03-14 01:42:35,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:35,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:35,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-14 01:42:35,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-14 01:42:35,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:35,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:35,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:35,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314962220] [2025-03-14 01:42:35,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314962220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:35,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:35,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:35,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863996777] [2025-03-14 01:42:35,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:35,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:35,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:35,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:35,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:35,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:35,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:35,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:35,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:35,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:35,951 INFO L124 PetriNetUnfolderBase]: 235/3231 cut-off events. [2025-03-14 01:42:35,951 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-14 01:42:35,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4427 conditions, 3231 events. 235/3231 cut-off events. For 289/293 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 28973 event pairs, 129 based on Foata normal form. 0/3046 useless extension candidates. Maximal degree in co-relation 3816. Up to 389 conditions per place. [2025-03-14 01:42:36,000 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/426 dead transitions. [2025-03-14 01:42:36,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 426 transitions, 1124 flow [2025-03-14 01:42:36,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:36,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:36,002 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 1041 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:36,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 426 transitions, 1124 flow [2025-03-14 01:42:36,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 426 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:36,008 INFO L231 Difference]: Finished difference. Result has 429 places, 423 transitions, 1039 flow [2025-03-14 01:42:36,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=429, PETRI_TRANSITIONS=423} [2025-03-14 01:42:36,009 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -95 predicate places. [2025-03-14 01:42:36,009 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 423 transitions, 1039 flow [2025-03-14 01:42:36,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:36,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:36,010 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] [2025-03-14 01:42:36,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-14 01:42:36,010 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:36,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1731823846, now seen corresponding path program 1 times [2025-03-14 01:42:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:36,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371803463] [2025-03-14 01:42:36,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:36,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-14 01:42:36,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-14 01:42:36,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:36,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:36,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:36,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371803463] [2025-03-14 01:42:36,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371803463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:36,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:36,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:36,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428772396] [2025-03-14 01:42:36,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:36,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:36,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:36,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:36,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:36,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:36,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 423 transitions, 1039 flow. Second operand has 3 states, 3 states have (on average 510.0) internal successors, (1530), 3 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:36,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:36,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:36,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:36,733 INFO L124 PetriNetUnfolderBase]: 365/4139 cut-off events. [2025-03-14 01:42:36,733 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-14 01:42:36,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5902 conditions, 4139 events. 365/4139 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 39992 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5371. Up to 528 conditions per place. [2025-03-14 01:42:36,798 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/425 dead transitions. [2025-03-14 01:42:36,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 1124 flow [2025-03-14 01:42:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:36,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:36,800 INFO L175 Difference]: Start difference. First operand has 429 places, 423 transitions, 1039 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:36,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 1124 flow [2025-03-14 01:42:36,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 425 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:36,806 INFO L231 Difference]: Finished difference. Result has 428 places, 422 transitions, 1037 flow [2025-03-14 01:42:36,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1037, PETRI_PLACES=428, PETRI_TRANSITIONS=422} [2025-03-14 01:42:36,807 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -96 predicate places. [2025-03-14 01:42:36,807 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 422 transitions, 1037 flow [2025-03-14 01:42:36,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.0) internal successors, (1530), 3 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:36,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:36,807 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] [2025-03-14 01:42:36,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-14 01:42:36,807 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:36,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2125712913, now seen corresponding path program 1 times [2025-03-14 01:42:36,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:36,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510951187] [2025-03-14 01:42:36,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:36,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:36,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-14 01:42:36,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-14 01:42:36,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:36,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:36,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:36,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510951187] [2025-03-14 01:42:36,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510951187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:36,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:36,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:36,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908212762] [2025-03-14 01:42:36,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:36,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:36,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:36,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:36,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:36,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 422 transitions, 1037 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:36,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:36,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:36,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:37,540 INFO L124 PetriNetUnfolderBase]: 412/4090 cut-off events. [2025-03-14 01:42:37,540 INFO L125 PetriNetUnfolderBase]: For 402/405 co-relation queries the response was YES. [2025-03-14 01:42:37,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5868 conditions, 4090 events. 412/4090 cut-off events. For 402/405 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 39292 event pairs, 268 based on Foata normal form. 0/3880 useless extension candidates. Maximal degree in co-relation 5753. Up to 692 conditions per place. [2025-03-14 01:42:37,631 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/424 dead transitions. [2025-03-14 01:42:37,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 424 transitions, 1124 flow [2025-03-14 01:42:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:37,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:37,634 INFO L175 Difference]: Start difference. First operand has 428 places, 422 transitions, 1037 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:37,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 424 transitions, 1124 flow [2025-03-14 01:42:37,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 424 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:37,639 INFO L231 Difference]: Finished difference. Result has 427 places, 421 transitions, 1035 flow [2025-03-14 01:42:37,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1035, PETRI_PLACES=427, PETRI_TRANSITIONS=421} [2025-03-14 01:42:37,640 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -97 predicate places. [2025-03-14 01:42:37,640 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 421 transitions, 1035 flow [2025-03-14 01:42:37,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:37,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:37,641 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] [2025-03-14 01:42:37,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-14 01:42:37,641 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:37,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:37,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1525570758, now seen corresponding path program 1 times [2025-03-14 01:42:37,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:37,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486454578] [2025-03-14 01:42:37,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:37,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:37,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-14 01:42:37,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-14 01:42:37,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:37,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:37,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486454578] [2025-03-14 01:42:37,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486454578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:37,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:37,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906234911] [2025-03-14 01:42:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:37,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:37,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:37,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:37,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:37,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:37,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 421 transitions, 1035 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:37,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:37,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:37,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:38,813 INFO L124 PetriNetUnfolderBase]: 802/6516 cut-off events. [2025-03-14 01:42:38,813 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-14 01:42:38,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9940 conditions, 6516 events. 802/6516 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 66964 event pairs, 545 based on Foata normal form. 0/6210 useless extension candidates. Maximal degree in co-relation 9524. Up to 1441 conditions per place. [2025-03-14 01:42:38,940 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-03-14 01:42:38,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 423 transitions, 1118 flow [2025-03-14 01:42:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:38,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:38,942 INFO L175 Difference]: Start difference. First operand has 427 places, 421 transitions, 1035 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:38,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 423 transitions, 1118 flow [2025-03-14 01:42:38,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 423 transitions, 1114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:38,950 INFO L231 Difference]: Finished difference. Result has 426 places, 420 transitions, 1033 flow [2025-03-14 01:42:38,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1033, PETRI_PLACES=426, PETRI_TRANSITIONS=420} [2025-03-14 01:42:38,950 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -98 predicate places. [2025-03-14 01:42:38,950 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 420 transitions, 1033 flow [2025-03-14 01:42:38,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:38,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:38,951 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] [2025-03-14 01:42:38,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-14 01:42:38,951 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread4Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:38,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:38,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1348814463, now seen corresponding path program 1 times [2025-03-14 01:42:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:38,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823646507] [2025-03-14 01:42:38,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:38,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-14 01:42:38,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-14 01:42:38,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:38,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:38,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823646507] [2025-03-14 01:42:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823646507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:38,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:38,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:38,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774416028] [2025-03-14 01:42:38,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:38,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:38,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:38,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:38,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:39,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:39,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 420 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 510.6666666666667) internal successors, (1532), 3 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:39,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:39,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:39,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:39,496 INFO L124 PetriNetUnfolderBase]: 235/3187 cut-off events. [2025-03-14 01:42:39,496 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-14 01:42:39,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4383 conditions, 3187 events. 235/3187 cut-off events. For 289/293 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 28496 event pairs, 129 based on Foata normal form. 0/3040 useless extension candidates. Maximal degree in co-relation 3976. Up to 389 conditions per place. [2025-03-14 01:42:39,550 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-03-14 01:42:39,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 422 transitions, 1116 flow [2025-03-14 01:42:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:39,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:39,552 INFO L175 Difference]: Start difference. First operand has 426 places, 420 transitions, 1033 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:39,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 422 transitions, 1116 flow [2025-03-14 01:42:39,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 422 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:39,558 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 1031 flow [2025-03-14 01:42:39,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=425, PETRI_TRANSITIONS=419} [2025-03-14 01:42:39,559 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -99 predicate places. [2025-03-14 01:42:39,559 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 1031 flow [2025-03-14 01:42:39,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.6666666666667) internal successors, (1532), 3 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:39,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:39,559 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] [2025-03-14 01:42:39,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-14 01:42:39,559 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:39,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1118612850, now seen corresponding path program 1 times [2025-03-14 01:42:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:39,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397224776] [2025-03-14 01:42:39,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:39,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-14 01:42:39,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-14 01:42:39,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:39,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:39,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:39,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397224776] [2025-03-14 01:42:39,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397224776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:39,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:39,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:39,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115913383] [2025-03-14 01:42:39,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:39,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:39,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:39,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:39,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:39,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:39,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 419 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 511.0) internal successors, (1533), 3 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:39,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:39,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:39,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:40,230 INFO L124 PetriNetUnfolderBase]: 365/4091 cut-off events. [2025-03-14 01:42:40,231 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-14 01:42:40,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5854 conditions, 4091 events. 365/4091 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 39292 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5455. Up to 528 conditions per place. [2025-03-14 01:42:40,293 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/421 dead transitions. [2025-03-14 01:42:40,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 421 transitions, 1116 flow [2025-03-14 01:42:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:40,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:40,295 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 1031 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:40,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 421 transitions, 1116 flow [2025-03-14 01:42:40,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 421 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:40,302 INFO L231 Difference]: Finished difference. Result has 424 places, 418 transitions, 1029 flow [2025-03-14 01:42:40,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=424, PETRI_TRANSITIONS=418} [2025-03-14 01:42:40,302 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -100 predicate places. [2025-03-14 01:42:40,302 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 418 transitions, 1029 flow [2025-03-14 01:42:40,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.0) internal successors, (1533), 3 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:40,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:40,303 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] [2025-03-14 01:42:40,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-14 01:42:40,303 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:40,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash 685098301, now seen corresponding path program 1 times [2025-03-14 01:42:40,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:40,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544489337] [2025-03-14 01:42:40,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:40,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-14 01:42:40,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-14 01:42:40,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:40,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:40,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:40,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544489337] [2025-03-14 01:42:40,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544489337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:40,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:40,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:40,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572450150] [2025-03-14 01:42:40,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:40,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:40,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:40,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:40,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:40,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 418 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:40,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:40,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:40,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:41,022 INFO L124 PetriNetUnfolderBase]: 412/4030 cut-off events. [2025-03-14 01:42:41,022 INFO L125 PetriNetUnfolderBase]: For 399/402 co-relation queries the response was YES. [2025-03-14 01:42:41,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5808 conditions, 4030 events. 412/4030 cut-off events. For 399/402 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 38424 event pairs, 268 based on Foata normal form. 0/3868 useless extension candidates. Maximal degree in co-relation 5729. Up to 692 conditions per place. [2025-03-14 01:42:41,087 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2025-03-14 01:42:41,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1116 flow [2025-03-14 01:42:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:41,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:41,089 INFO L175 Difference]: Start difference. First operand has 424 places, 418 transitions, 1029 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:41,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1116 flow [2025-03-14 01:42:41,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 420 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:41,095 INFO L231 Difference]: Finished difference. Result has 423 places, 417 transitions, 1027 flow [2025-03-14 01:42:41,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1027, PETRI_PLACES=423, PETRI_TRANSITIONS=417} [2025-03-14 01:42:41,096 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -101 predicate places. [2025-03-14 01:42:41,096 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 417 transitions, 1027 flow [2025-03-14 01:42:41,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:41,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:41,097 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] [2025-03-14 01:42:41,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-14 01:42:41,097 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:41,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1021132290, now seen corresponding path program 1 times [2025-03-14 01:42:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:41,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880076352] [2025-03-14 01:42:41,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:41,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:41,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-14 01:42:41,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-14 01:42:41,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:41,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:41,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880076352] [2025-03-14 01:42:41,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880076352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:41,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:41,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:41,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540965812] [2025-03-14 01:42:41,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:41,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:41,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:41,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:41,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:41,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:41,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 417 transitions, 1027 flow. Second operand has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:41,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:41,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:41,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:42,308 INFO L124 PetriNetUnfolderBase]: 814/6649 cut-off events. [2025-03-14 01:42:42,308 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-14 01:42:42,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10127 conditions, 6649 events. 814/6649 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 67683 event pairs, 545 based on Foata normal form. 0/6412 useless extension candidates. Maximal degree in co-relation 9825. Up to 1441 conditions per place. [2025-03-14 01:42:42,436 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2025-03-14 01:42:42,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 419 transitions, 1110 flow [2025-03-14 01:42:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:42,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:42,438 INFO L175 Difference]: Start difference. First operand has 423 places, 417 transitions, 1027 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:42,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 419 transitions, 1110 flow [2025-03-14 01:42:42,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 419 transitions, 1106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:42,444 INFO L231 Difference]: Finished difference. Result has 422 places, 416 transitions, 1025 flow [2025-03-14 01:42:42,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=422, PETRI_TRANSITIONS=416} [2025-03-14 01:42:42,445 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -102 predicate places. [2025-03-14 01:42:42,445 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 416 transitions, 1025 flow [2025-03-14 01:42:42,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:42,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:42,445 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:42:42,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-14 01:42:42,446 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread4Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:42,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:42,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1284076107, now seen corresponding path program 1 times [2025-03-14 01:42:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:42,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569166305] [2025-03-14 01:42:42,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:42,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-14 01:42:42,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-14 01:42:42,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:42,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:42,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:42,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569166305] [2025-03-14 01:42:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569166305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:42,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:42,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590675522] [2025-03-14 01:42:42,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:42,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:42,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:42,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:42,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:42,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 416 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:42,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:42,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:42,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:42,914 INFO L124 PetriNetUnfolderBase]: 235/3143 cut-off events. [2025-03-14 01:42:42,914 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-14 01:42:42,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 3143 events. 235/3143 cut-off events. For 289/293 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 27929 event pairs, 129 based on Foata normal form. 0/3034 useless extension candidates. Maximal degree in co-relation 4136. Up to 389 conditions per place. [2025-03-14 01:42:42,965 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2025-03-14 01:42:42,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 418 transitions, 1108 flow [2025-03-14 01:42:42,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:42,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:42,966 INFO L175 Difference]: Start difference. First operand has 422 places, 416 transitions, 1025 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:42,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 418 transitions, 1108 flow [2025-03-14 01:42:42,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 418 transitions, 1104 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:42,973 INFO L231 Difference]: Finished difference. Result has 421 places, 415 transitions, 1023 flow [2025-03-14 01:42:42,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=421, PETRI_TRANSITIONS=415} [2025-03-14 01:42:42,974 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -103 predicate places. [2025-03-14 01:42:42,974 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 415 transitions, 1023 flow [2025-03-14 01:42:42,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:42,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:42,974 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, 1, 1, 1] [2025-03-14 01:42:42,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-14 01:42:42,975 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:42,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash -411499589, now seen corresponding path program 1 times [2025-03-14 01:42:42,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:42,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824142220] [2025-03-14 01:42:42,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:42,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:42,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-14 01:42:42,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-14 01:42:42,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:42,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:43,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:43,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824142220] [2025-03-14 01:42:43,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824142220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:43,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:43,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:43,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003006376] [2025-03-14 01:42:43,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:43,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:43,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:43,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:43,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:43,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-14 01:42:43,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 415 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:43,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:43,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-14 01:42:43,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:43,619 INFO L124 PetriNetUnfolderBase]: 412/3973 cut-off events. [2025-03-14 01:42:43,619 INFO L125 PetriNetUnfolderBase]: For 401/404 co-relation queries the response was YES. [2025-03-14 01:42:43,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5761 conditions, 3973 events. 412/3973 cut-off events. For 401/404 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 37694 event pairs, 268 based on Foata normal form. 0/3856 useless extension candidates. Maximal degree in co-relation 5551. Up to 692 conditions per place. [2025-03-14 01:42:43,693 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2025-03-14 01:42:43,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 417 transitions, 1110 flow [2025-03-14 01:42:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-14 01:42:43,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-14 01:42:43,695 INFO L175 Difference]: Start difference. First operand has 421 places, 415 transitions, 1023 flow. Second operand 3 states and 1545 transitions. [2025-03-14 01:42:43,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 417 transitions, 1110 flow [2025-03-14 01:42:43,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 417 transitions, 1106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:43,701 INFO L231 Difference]: Finished difference. Result has 420 places, 414 transitions, 1021 flow [2025-03-14 01:42:43,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1021, PETRI_PLACES=420, PETRI_TRANSITIONS=414} [2025-03-14 01:42:43,702 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -104 predicate places. [2025-03-14 01:42:43,702 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 414 transitions, 1021 flow [2025-03-14 01:42:43,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:43,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:43,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:43,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-14 01:42:43,703 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-14 01:42:43,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1213462221, now seen corresponding path program 1 times [2025-03-14 01:42:43,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:43,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432369253] [2025-03-14 01:42:43,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:43,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:43,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-14 01:42:43,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-14 01:42:43,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:43,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:43,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:43,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432369253] [2025-03-14 01:42:43,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432369253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:43,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100622721] [2025-03-14 01:42:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:43,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:43,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:43,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:43,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:43,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-14 01:42:43,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 414 transitions, 1021 flow. Second operand has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:43,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:43,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-14 01:42:43,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:44,231 INFO L124 PetriNetUnfolderBase]: 235/3119 cut-off events. [2025-03-14 01:42:44,231 INFO L125 PetriNetUnfolderBase]: For 280/284 co-relation queries the response was YES. [2025-03-14 01:42:44,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 3119 events. 235/3119 cut-off events. For 280/284 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 27643 event pairs, 129 based on Foata normal form. 0/3028 useless extension candidates. Maximal degree in co-relation 4185. Up to 389 conditions per place. [2025-03-14 01:42:44,271 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 0 selfloop transitions, 0 changer transitions 416/416 dead transitions. [2025-03-14 01:42:44,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 416 transitions, 1104 flow [2025-03-14 01:42:44,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-14 01:42:44,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-14 01:42:44,273 INFO L175 Difference]: Start difference. First operand has 420 places, 414 transitions, 1021 flow. Second operand 3 states and 1547 transitions. [2025-03-14 01:42:44,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 416 transitions, 1104 flow [2025-03-14 01:42:44,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 416 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:44,277 INFO L231 Difference]: Finished difference. Result has 419 places, 0 transitions, 0 flow [2025-03-14 01:42:44,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=419, PETRI_TRANSITIONS=0} [2025-03-14 01:42:44,278 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -105 predicate places. [2025-03-14 01:42:44,278 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 0 transitions, 0 flow [2025-03-14 01:42:44,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:44,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (202 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (201 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (200 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (199 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (198 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (197 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (196 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (195 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (194 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (193 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (192 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (191 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (190 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (189 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (188 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (187 of 203 remaining) [2025-03-14 01:42:44,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (186 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (185 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (184 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (183 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (182 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (181 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (180 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (179 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (178 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (177 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (176 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (175 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (174 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (173 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (172 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (171 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (170 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (169 of 203 remaining) [2025-03-14 01:42:44,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (168 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (167 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (166 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (165 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (164 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (163 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (162 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (161 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (160 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (159 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (158 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (157 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (156 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (155 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (154 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (153 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (152 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (151 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (150 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (149 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (148 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (147 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (146 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (145 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (144 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (143 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (142 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (141 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (140 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (139 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (138 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (137 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (136 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (135 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (134 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (133 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (132 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (131 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (130 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (129 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (128 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (127 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (126 of 203 remaining) [2025-03-14 01:42:44,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (125 of 203 remaining) [2025-03-14 01:42:44,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (124 of 203 remaining) [2025-03-14 01:42:44,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (123 of 203 remaining) [2025-03-14 01:42:44,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (122 of 203 remaining) [2025-03-14 01:42:44,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (121 of 203 remaining) [2025-03-14 01:42:44,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (120 of 203 remaining) [2025-03-14 01:42:44,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (119 of 203 remaining) [2025-03-14 01:42:44,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (118 of 203 remaining) [2025-03-14 01:42:44,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (117 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (116 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (115 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (114 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (113 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (112 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (111 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (110 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (109 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (108 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (107 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (106 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (105 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (104 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (103 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (102 of 203 remaining) [2025-03-14 01:42:44,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (101 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (100 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (99 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (98 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (97 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (96 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (95 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (94 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (93 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (92 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (91 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (90 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (89 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (88 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (87 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (86 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (85 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (84 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (83 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (82 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (81 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (80 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (79 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (77 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (76 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (75 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (74 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (73 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (72 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (71 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 203 remaining) [2025-03-14 01:42:44,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (68 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (67 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (66 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (65 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (64 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (63 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (62 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (61 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (60 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (59 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (58 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (57 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (56 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (55 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (54 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (52 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (51 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (48 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (47 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (46 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (45 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (44 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (43 of 203 remaining) [2025-03-14 01:42:44,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (42 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (41 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (40 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (39 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (38 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (37 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (36 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (35 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (34 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (33 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (32 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (30 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (29 of 203 remaining) [2025-03-14 01:42:44,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (28 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (27 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (26 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (25 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (24 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (23 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (22 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (21 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (20 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (19 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (18 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (17 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (16 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (15 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (14 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (10 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (9 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (8 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 203 remaining) [2025-03-14 01:42:44,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 203 remaining) [2025-03-14 01:42:44,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 203 remaining) [2025-03-14 01:42:44,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 203 remaining) [2025-03-14 01:42:44,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 203 remaining) [2025-03-14 01:42:44,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 203 remaining) [2025-03-14 01:42:44,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 203 remaining) [2025-03-14 01:42:44,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 203 remaining) [2025-03-14 01:42:44,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-14 01:42:44,291 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-14 01:42:44,295 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:42:44,295 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:42:44,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:42:44 BasicIcfg [2025-03-14 01:42:44,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:42:44,304 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:42:44,304 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:42:44,304 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:42:44,304 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:11" (3/4) ... [2025-03-14 01:42:44,305 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:42:44,308 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:42:44,308 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:42:44,308 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:42:44,308 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-14 01:42:44,311 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-14 01:42:44,311 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:42:44,311 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-14 01:42:44,311 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:42:44,371 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:42:44,372 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:42:44,372 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:42:44,373 INFO L158 Benchmark]: Toolchain (without parser) took 33845.04ms. Allocated memory was 167.8MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 122.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 870.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:44,373 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:44,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.66ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 109.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:44,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.11ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:44,374 INFO L158 Benchmark]: Boogie Preprocessor took 34.00ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 106.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:44,374 INFO L158 Benchmark]: IcfgBuilder took 615.15ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 71.8MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 01:42:44,374 INFO L158 Benchmark]: TraceAbstraction took 32907.50ms. Allocated memory was 167.8MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 71.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 811.6MB. Max. memory is 16.1GB. [2025-03-14 01:42:44,374 INFO L158 Benchmark]: Witness Printer took 68.11ms. Allocated memory is still 2.4GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:44,377 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.66ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 109.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.11ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.00ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 106.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 615.15ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 71.8MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 32907.50ms. Allocated memory was 167.8MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 71.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 811.6MB. Max. memory is 16.1GB. * Witness Printer took 68.11ms. Allocated memory is still 2.4GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: 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: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: 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: 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: 67]: 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: 68]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: 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: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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 9 procedures, 918 locations, 203 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: 32.8s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5794 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1900 mSDsluCounter, 984 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 283 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5459 IncrementalHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 283 mSolverCounterUnsat, 976 mSDtfsCounter, 5459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1073occurred in iteration=12, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 4063 NumberOfCodeBlocks, 4063 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4024 ConstructedInterpolants, 0 QuantifiedInterpolants, 4102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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 107 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:42:44,395 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