./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-04 06:52:08,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:52:08,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:52:08,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:52:08,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:52:08,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:52:08,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:52:08,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:52:08,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:52:08,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:52:08,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:52:08,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:52:08,146 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:52:08,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:52:08,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:52:08,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:52:08,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:52:08,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:52:08,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:52:08,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:52:08,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:52:08,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:52:08,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:08,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:52:08,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:52:08,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:52:08,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:52:08,152 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-04 06:52:08,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:52:08,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:52:08,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:52:08,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:52:08,387 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:52:08,388 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-04 06:52:09,565 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c305e56e3/ee2281805dc949d08fa7b2e6f03c0385/FLAGf7d2fb648 [2025-03-04 06:52:09,772 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:52:09,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-03-04 06:52:09,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c305e56e3/ee2281805dc949d08fa7b2e6f03c0385/FLAGf7d2fb648 [2025-03-04 06:52:09,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c305e56e3/ee2281805dc949d08fa7b2e6f03c0385 [2025-03-04 06:52:09,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:52:09,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:52:09,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:52:09,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:52:09,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:52:09,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:09,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20573504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09, skipping insertion in model container [2025-03-04 06:52:09,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:09,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:52:09,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:52:09,942 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:52:09,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:52:09,982 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:52:09,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09 WrapperNode [2025-03-04 06:52:09,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:52:09,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:52:09,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:52:09,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:52:09,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:09,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:10,005 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-03-04 06:52:10,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:52:10,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:52:10,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:52:10,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:52:10,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:10,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:10,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:10,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:10,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:10,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:10,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:10,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:10,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:52:10,028 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:52:10,028 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:52:10,028 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:52:10,029 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (1/1) ... [2025-03-04 06:52:10,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:10,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:10,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:52:10,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:52:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:52:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:52:10,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:52:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:52:10,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:52:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:52:10,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:52:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 06:52:10,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 06:52:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:52:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:52:10,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:52:10,073 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:52:10,143 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:52:10,146 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:52:10,608 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:52:10,609 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:52:10,630 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:52:10,630 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:52:10,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:10 BoogieIcfgContainer [2025-03-04 06:52:10,632 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:52:10,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:52:10,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:52:10,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:52:10,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:52:09" (1/3) ... [2025-03-04 06:52:10,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4a24c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:52:10, skipping insertion in model container [2025-03-04 06:52:10,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:09" (2/3) ... [2025-03-04 06:52:10,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4a24c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:52:10, skipping insertion in model container [2025-03-04 06:52:10,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:10" (3/3) ... [2025-03-04 06:52:10,639 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2025-03-04 06:52:10,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:52:10,651 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-04 06:52:10,651 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:52:10,756 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:52:10,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 546 places, 547 transitions, 1122 flow [2025-03-04 06:52:10,972 INFO L124 PetriNetUnfolderBase]: 14/543 cut-off events. [2025-03-04 06:52:10,974 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:52:10,994 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-04 06:52:10,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 546 places, 547 transitions, 1122 flow [2025-03-04 06:52:11,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 524 places, 523 transitions, 1070 flow [2025-03-04 06:52:11,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:52:11,026 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;@440b31e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:52:11,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 203 error locations. [2025-03-04 06:52:11,030 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:52:11,031 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-04 06:52:11,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:52:11,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:11,032 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-04 06:52:11,032 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-04 06:52:11,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:11,037 INFO L85 PathProgramCache]: Analyzing trace with hash -194621866, now seen corresponding path program 1 times [2025-03-04 06:52:11,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:11,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508055184] [2025-03-04 06:52:11,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:11,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 06:52:11,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 06:52:11,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:11,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:11,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:11,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508055184] [2025-03-04 06:52:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508055184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:11,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:11,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:11,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308238506] [2025-03-04 06:52:11,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:11,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:11,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:11,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:11,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:11,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 547 [2025-03-04 06:52:11,345 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-04 06:52:11,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:11,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 547 [2025-03-04 06:52:11,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:11,615 INFO L124 PetriNetUnfolderBase]: 76/868 cut-off events. [2025-03-04 06:52:11,615 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-04 06:52:11,624 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-04 06:52:11,637 INFO L140 encePairwiseOnDemand]: 539/547 looper letters, 36 selfloop transitions, 2 changer transitions 1/517 dead transitions. [2025-03-04 06:52:11,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 517 transitions, 1134 flow [2025-03-04 06:52:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1544 transitions. [2025-03-04 06:52:11,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9408897014015845 [2025-03-04 06:52:11,655 INFO L175 Difference]: Start difference. First operand has 524 places, 523 transitions, 1070 flow. Second operand 3 states and 1544 transitions. [2025-03-04 06:52:11,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 517 transitions, 1134 flow [2025-03-04 06:52:11,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 517 transitions, 1118 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 06:52:11,672 INFO L231 Difference]: Finished difference. Result has 517 places, 516 transitions, 1044 flow [2025-03-04 06:52:11,675 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-04 06:52:11,678 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -7 predicate places. [2025-03-04 06:52:11,678 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 516 transitions, 1044 flow [2025-03-04 06:52:11,679 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-04 06:52:11,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:11,679 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-04 06:52:11,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:52:11,680 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-04 06:52:11,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:11,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1223025836, now seen corresponding path program 1 times [2025-03-04 06:52:11,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:11,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454255897] [2025-03-04 06:52:11,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:11,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:11,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 06:52:11,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 06:52:11,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:11,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:11,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:11,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454255897] [2025-03-04 06:52:11,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454255897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:11,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:11,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:11,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693461761] [2025-03-04 06:52:11,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:11,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:11,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:11,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:11,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:11,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 547 [2025-03-04 06:52:11,842 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-04 06:52:11,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:11,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 547 [2025-03-04 06:52:11,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:12,031 INFO L124 PetriNetUnfolderBase]: 76/866 cut-off events. [2025-03-04 06:52:12,031 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 06:52:12,041 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-04 06:52:12,051 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 35 selfloop transitions, 2 changer transitions 0/515 dead transitions. [2025-03-04 06:52:12,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 515 transitions, 1116 flow [2025-03-04 06:52:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2025-03-04 06:52:12,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9390615478366849 [2025-03-04 06:52:12,054 INFO L175 Difference]: Start difference. First operand has 517 places, 516 transitions, 1044 flow. Second operand 3 states and 1541 transitions. [2025-03-04 06:52:12,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 515 transitions, 1116 flow [2025-03-04 06:52:12,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 515 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:12,065 INFO L231 Difference]: Finished difference. Result has 515 places, 515 transitions, 1042 flow [2025-03-04 06:52:12,065 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-04 06:52:12,066 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -9 predicate places. [2025-03-04 06:52:12,066 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 515 transitions, 1042 flow [2025-03-04 06:52:12,067 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-04 06:52:12,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:12,067 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-04 06:52:12,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:52:12,067 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-04 06:52:12,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:12,068 INFO L85 PathProgramCache]: Analyzing trace with hash 241717247, now seen corresponding path program 1 times [2025-03-04 06:52:12,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:12,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978750746] [2025-03-04 06:52:12,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:12,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:12,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 06:52:12,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 06:52:12,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:12,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:12,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:12,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978750746] [2025-03-04 06:52:12,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978750746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:12,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:12,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:12,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441162659] [2025-03-04 06:52:12,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:12,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:12,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:12,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:12,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:12,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 547 [2025-03-04 06:52:12,203 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-04 06:52:12,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:12,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 547 [2025-03-04 06:52:12,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:12,393 INFO L124 PetriNetUnfolderBase]: 76/793 cut-off events. [2025-03-04 06:52:12,393 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-04 06:52:12,405 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-04 06:52:12,418 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/514 dead transitions. [2025-03-04 06:52:12,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 514 transitions, 1116 flow [2025-03-04 06:52:12,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1539 transitions. [2025-03-04 06:52:12,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9378427787934186 [2025-03-04 06:52:12,422 INFO L175 Difference]: Start difference. First operand has 515 places, 515 transitions, 1042 flow. Second operand 3 states and 1539 transitions. [2025-03-04 06:52:12,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 514 transitions, 1116 flow [2025-03-04 06:52:12,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 514 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:12,428 INFO L231 Difference]: Finished difference. Result has 514 places, 514 transitions, 1040 flow [2025-03-04 06:52:12,429 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-04 06:52:12,429 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -10 predicate places. [2025-03-04 06:52:12,429 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 514 transitions, 1040 flow [2025-03-04 06:52:12,430 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-04 06:52:12,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:12,430 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-04 06:52:12,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:52:12,430 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-04 06:52:12,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash 399293554, now seen corresponding path program 1 times [2025-03-04 06:52:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601165121] [2025-03-04 06:52:12,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:12,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:12,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:52:12,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:52:12,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:12,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601165121] [2025-03-04 06:52:12,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601165121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:12,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:12,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428141787] [2025-03-04 06:52:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:12,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:12,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:12,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:12,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:12,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 547 [2025-03-04 06:52:12,567 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-04 06:52:12,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:12,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 547 [2025-03-04 06:52:12,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:12,698 INFO L124 PetriNetUnfolderBase]: 76/720 cut-off events. [2025-03-04 06:52:12,699 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-04 06:52:12,707 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-04 06:52:12,714 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 35 selfloop transitions, 2 changer transitions 0/513 dead transitions. [2025-03-04 06:52:12,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 513 transitions, 1112 flow [2025-03-04 06:52:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2025-03-04 06:52:12,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9390615478366849 [2025-03-04 06:52:12,717 INFO L175 Difference]: Start difference. First operand has 514 places, 514 transitions, 1040 flow. Second operand 3 states and 1541 transitions. [2025-03-04 06:52:12,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 513 transitions, 1112 flow [2025-03-04 06:52:12,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 513 transitions, 1108 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:12,723 INFO L231 Difference]: Finished difference. Result has 513 places, 513 transitions, 1038 flow [2025-03-04 06:52:12,724 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-04 06:52:12,725 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -11 predicate places. [2025-03-04 06:52:12,725 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 513 transitions, 1038 flow [2025-03-04 06:52:12,726 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-04 06:52:12,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:12,726 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-04 06:52:12,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:52:12,726 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-04 06:52:12,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:12,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1296327910, now seen corresponding path program 1 times [2025-03-04 06:52:12,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:12,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670512312] [2025-03-04 06:52:12,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:12,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:12,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:52:12,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:52:12,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:12,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:12,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:12,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670512312] [2025-03-04 06:52:12,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670512312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:12,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:12,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:12,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532433948] [2025-03-04 06:52:12,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:12,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:12,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:12,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:12,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:12,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 521 out of 547 [2025-03-04 06:52:12,785 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-04 06:52:12,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:12,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 521 of 547 [2025-03-04 06:52:12,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:13,229 INFO L124 PetriNetUnfolderBase]: 102/3430 cut-off events. [2025-03-04 06:52:13,229 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:52:13,254 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-04 06:52:13,274 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 15 selfloop transitions, 2 changer transitions 0/512 dead transitions. [2025-03-04 06:52:13,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 512 transitions, 1070 flow [2025-03-04 06:52:13,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1581 transitions. [2025-03-04 06:52:13,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9634369287020109 [2025-03-04 06:52:13,277 INFO L175 Difference]: Start difference. First operand has 513 places, 513 transitions, 1038 flow. Second operand 3 states and 1581 transitions. [2025-03-04 06:52:13,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 512 transitions, 1070 flow [2025-03-04 06:52:13,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 512 transitions, 1066 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:13,282 INFO L231 Difference]: Finished difference. Result has 512 places, 512 transitions, 1036 flow [2025-03-04 06:52:13,282 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-04 06:52:13,283 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -12 predicate places. [2025-03-04 06:52:13,283 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 512 transitions, 1036 flow [2025-03-04 06:52:13,284 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-04 06:52:13,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:13,284 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-04 06:52:13,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:52:13,284 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-04 06:52:13,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1700320514, now seen corresponding path program 1 times [2025-03-04 06:52:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:13,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468450399] [2025-03-04 06:52:13,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:13,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 06:52:13,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 06:52:13,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:13,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:13,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-04 06:52:13,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:13,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468450399] [2025-03-04 06:52:13,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468450399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:13,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:13,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572515703] [2025-03-04 06:52:13,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:13,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:13,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:13,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:13,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 547 [2025-03-04 06:52:13,420 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-04 06:52:13,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:13,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 547 [2025-03-04 06:52:13,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:13,607 INFO L124 PetriNetUnfolderBase]: 121/846 cut-off events. [2025-03-04 06:52:13,607 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:52:13,616 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-04 06:52:13,626 INFO L140 encePairwiseOnDemand]: 514/547 looper letters, 41 selfloop transitions, 15 changer transitions 0/498 dead transitions. [2025-03-04 06:52:13,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 498 transitions, 1123 flow [2025-03-04 06:52:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-03-04 06:52:13,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9043266301035954 [2025-03-04 06:52:13,630 INFO L175 Difference]: Start difference. First operand has 512 places, 512 transitions, 1036 flow. Second operand 3 states and 1484 transitions. [2025-03-04 06:52:13,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 498 transitions, 1123 flow [2025-03-04 06:52:13,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 498 transitions, 1119 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:13,638 INFO L231 Difference]: Finished difference. Result has 495 places, 495 transitions, 1045 flow [2025-03-04 06:52:13,639 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-04 06:52:13,640 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -29 predicate places. [2025-03-04 06:52:13,641 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 495 transitions, 1045 flow [2025-03-04 06:52:13,641 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-04 06:52:13,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:13,642 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-04 06:52:13,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:52:13,642 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-04 06:52:13,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1920408975, now seen corresponding path program 1 times [2025-03-04 06:52:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:13,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457598106] [2025-03-04 06:52:13,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:13,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:13,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 06:52:13,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 06:52:13,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:13,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:13,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:13,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457598106] [2025-03-04 06:52:13,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457598106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19923213] [2025-03-04 06:52:13,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:13,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:13,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:13,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:13,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 547 [2025-03-04 06:52:13,769 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-04 06:52:13,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:13,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 547 [2025-03-04 06:52:13,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:13,961 INFO L124 PetriNetUnfolderBase]: 121/830 cut-off events. [2025-03-04 06:52:13,961 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-04 06:52:13,973 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-04 06:52:13,983 INFO L140 encePairwiseOnDemand]: 515/547 looper letters, 39 selfloop transitions, 15 changer transitions 0/482 dead transitions. [2025-03-04 06:52:13,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 482 transitions, 1130 flow [2025-03-04 06:52:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1490 transitions. [2025-03-04 06:52:13,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079829372333943 [2025-03-04 06:52:13,987 INFO L175 Difference]: Start difference. First operand has 495 places, 495 transitions, 1045 flow. Second operand 3 states and 1490 transitions. [2025-03-04 06:52:13,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 482 transitions, 1130 flow [2025-03-04 06:52:13,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 482 transitions, 1115 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:52:13,995 INFO L231 Difference]: Finished difference. Result has 480 places, 479 transitions, 1045 flow [2025-03-04 06:52:13,996 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-04 06:52:13,996 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -44 predicate places. [2025-03-04 06:52:13,997 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 479 transitions, 1045 flow [2025-03-04 06:52:13,999 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-04 06:52:13,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:13,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:13,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:52:13,999 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-04 06:52:14,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash -811502008, now seen corresponding path program 1 times [2025-03-04 06:52:14,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:14,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109092328] [2025-03-04 06:52:14,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:14,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:14,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:52:14,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:52:14,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:14,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109092328] [2025-03-04 06:52:14,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109092328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:14,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:14,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683897864] [2025-03-04 06:52:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:14,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:14,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:14,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:14,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:14,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 547 [2025-03-04 06:52:14,138 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-04 06:52:14,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:14,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 547 [2025-03-04 06:52:14,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:14,349 INFO L124 PetriNetUnfolderBase]: 128/1092 cut-off events. [2025-03-04 06:52:14,349 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-04 06:52:14,364 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-04 06:52:14,372 INFO L140 encePairwiseOnDemand]: 513/547 looper letters, 44 selfloop transitions, 16 changer transitions 0/469 dead transitions. [2025-03-04 06:52:14,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 469 transitions, 1151 flow [2025-03-04 06:52:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1488 transitions. [2025-03-04 06:52:14,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.906764168190128 [2025-03-04 06:52:14,375 INFO L175 Difference]: Start difference. First operand has 480 places, 479 transitions, 1045 flow. Second operand 3 states and 1488 transitions. [2025-03-04 06:52:14,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 469 transitions, 1151 flow [2025-03-04 06:52:14,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 469 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:52:14,380 INFO L231 Difference]: Finished difference. Result has 464 places, 463 transitions, 1050 flow [2025-03-04 06:52:14,381 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-04 06:52:14,381 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -60 predicate places. [2025-03-04 06:52:14,382 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 463 transitions, 1050 flow [2025-03-04 06:52:14,382 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-04 06:52:14,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:14,382 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-04 06:52:14,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:52:14,383 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-04 06:52:14,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1830650305, now seen corresponding path program 1 times [2025-03-04 06:52:14,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:14,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656559188] [2025-03-04 06:52:14,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:14,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:14,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:52:14,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:52:14,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:14,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:14,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:14,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656559188] [2025-03-04 06:52:14,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656559188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:14,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:14,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:52:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227892479] [2025-03-04 06:52:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:14,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:52:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:14,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:52:14,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:52:14,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 520 out of 547 [2025-03-04 06:52:14,469 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-04 06:52:14,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:14,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 520 of 547 [2025-03-04 06:52:14,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:14,571 INFO L124 PetriNetUnfolderBase]: 12/791 cut-off events. [2025-03-04 06:52:14,571 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 06:52:14,578 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-04 06:52:14,581 INFO L140 encePairwiseOnDemand]: 541/547 looper letters, 19 selfloop transitions, 5 changer transitions 0/468 dead transitions. [2025-03-04 06:52:14,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 468 transitions, 1108 flow [2025-03-04 06:52:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:52:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:52:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2625 transitions. [2025-03-04 06:52:14,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9597806215722121 [2025-03-04 06:52:14,584 INFO L175 Difference]: Start difference. First operand has 464 places, 463 transitions, 1050 flow. Second operand 5 states and 2625 transitions. [2025-03-04 06:52:14,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 468 transitions, 1108 flow [2025-03-04 06:52:14,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 468 transitions, 1092 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:52:14,590 INFO L231 Difference]: Finished difference. Result has 471 places, 467 transitions, 1072 flow [2025-03-04 06:52:14,590 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-04 06:52:14,591 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -53 predicate places. [2025-03-04 06:52:14,591 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 467 transitions, 1072 flow [2025-03-04 06:52:14,592 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-04 06:52:14,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:14,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:14,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:52:14,592 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-04 06:52:14,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1924143831, now seen corresponding path program 1 times [2025-03-04 06:52:14,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:14,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79397675] [2025-03-04 06:52:14,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:14,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:14,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:52:14,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:52:14,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:14,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:14,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:14,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79397675] [2025-03-04 06:52:14,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79397675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:14,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:14,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:14,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190237744] [2025-03-04 06:52:14,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:14,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:14,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:14,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:14,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:14,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 547 [2025-03-04 06:52:14,695 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-04 06:52:14,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:14,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 547 [2025-03-04 06:52:14,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:14,923 INFO L124 PetriNetUnfolderBase]: 208/1557 cut-off events. [2025-03-04 06:52:14,924 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-04 06:52:14,939 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-04 06:52:14,945 INFO L140 encePairwiseOnDemand]: 515/547 looper letters, 40 selfloop transitions, 15 changer transitions 10/458 dead transitions. [2025-03-04 06:52:14,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 458 transitions, 1175 flow [2025-03-04 06:52:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1493 transitions. [2025-03-04 06:52:14,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098110907982937 [2025-03-04 06:52:14,948 INFO L175 Difference]: Start difference. First operand has 471 places, 467 transitions, 1072 flow. Second operand 3 states and 1493 transitions. [2025-03-04 06:52:14,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 458 transitions, 1175 flow [2025-03-04 06:52:14,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 458 transitions, 1175 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:14,958 INFO L231 Difference]: Finished difference. Result has 457 places, 441 transitions, 1066 flow [2025-03-04 06:52:14,959 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-04 06:52:14,959 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -67 predicate places. [2025-03-04 06:52:14,959 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 441 transitions, 1066 flow [2025-03-04 06:52:14,960 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-04 06:52:14,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:14,960 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-04 06:52:14,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:52:14,960 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-04 06:52:14,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1112923681, now seen corresponding path program 1 times [2025-03-04 06:52:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:14,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307093228] [2025-03-04 06:52:14,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:14,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:14,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 06:52:14,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 06:52:14,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:14,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:14,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:14,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307093228] [2025-03-04 06:52:14,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307093228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:14,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:14,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:14,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461326165] [2025-03-04 06:52:14,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:14,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:14,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:14,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:15,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 519 out of 547 [2025-03-04 06:52:15,005 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-04 06:52:15,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:15,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 519 of 547 [2025-03-04 06:52:15,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:16,794 INFO L124 PetriNetUnfolderBase]: 751/14488 cut-off events. [2025-03-04 06:52:16,794 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2025-03-04 06:52:16,876 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-04 06:52:16,911 INFO L140 encePairwiseOnDemand]: 539/547 looper letters, 19 selfloop transitions, 4 changer transitions 0/444 dead transitions. [2025-03-04 06:52:16,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 444 transitions, 1121 flow [2025-03-04 06:52:16,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1584 transitions. [2025-03-04 06:52:16,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652650822669104 [2025-03-04 06:52:16,914 INFO L175 Difference]: Start difference. First operand has 457 places, 441 transitions, 1066 flow. Second operand 3 states and 1584 transitions. [2025-03-04 06:52:16,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 444 transitions, 1121 flow [2025-03-04 06:52:16,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 444 transitions, 1106 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:52:16,925 INFO L231 Difference]: Finished difference. Result has 445 places, 441 transitions, 1071 flow [2025-03-04 06:52:16,926 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-04 06:52:16,926 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -79 predicate places. [2025-03-04 06:52:16,926 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 441 transitions, 1071 flow [2025-03-04 06:52:16,927 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-04 06:52:16,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:16,927 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-04 06:52:16,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:52:16,928 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-04 06:52:16,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash -134299826, now seen corresponding path program 1 times [2025-03-04 06:52:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:16,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256064634] [2025-03-04 06:52:16,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:16,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:16,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 06:52:16,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:52:16,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:16,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:16,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:16,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256064634] [2025-03-04 06:52:16,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256064634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:16,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:16,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:16,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244472582] [2025-03-04 06:52:16,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:16,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:16,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:16,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:16,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:17,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:17,041 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-04 06:52:17,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:17,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:17,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:17,602 INFO L124 PetriNetUnfolderBase]: 365/4355 cut-off events. [2025-03-04 06:52:17,602 INFO L125 PetriNetUnfolderBase]: For 167/179 co-relation queries the response was YES. [2025-03-04 06:52:17,656 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-04 06:52:17,752 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-03-04 06:52:17,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 443 transitions, 1156 flow [2025-03-04 06:52:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:17,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:17,755 INFO L175 Difference]: Start difference. First operand has 445 places, 441 transitions, 1071 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:17,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 443 transitions, 1156 flow [2025-03-04 06:52:17,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 443 transitions, 1156 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:17,761 INFO L231 Difference]: Finished difference. Result has 446 places, 440 transitions, 1073 flow [2025-03-04 06:52:17,762 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-04 06:52:17,763 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -78 predicate places. [2025-03-04 06:52:17,764 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 440 transitions, 1073 flow [2025-03-04 06:52:17,764 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-04 06:52:17,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:17,765 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-04 06:52:17,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:52:17,765 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-04 06:52:17,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash 895529178, now seen corresponding path program 1 times [2025-03-04 06:52:17,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:17,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792777554] [2025-03-04 06:52:17,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:17,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:17,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 06:52:17,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:52:17,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:17,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:17,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:17,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792777554] [2025-03-04 06:52:17,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792777554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:17,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:17,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:17,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185331705] [2025-03-04 06:52:17,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:17,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:17,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:17,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:17,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:17,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:17,882 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-04 06:52:17,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:17,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:17,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:18,961 INFO L124 PetriNetUnfolderBase]: 742/5750 cut-off events. [2025-03-04 06:52:18,961 INFO L125 PetriNetUnfolderBase]: For 670/678 co-relation queries the response was YES. [2025-03-04 06:52:19,036 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-04 06:52:19,072 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/442 dead transitions. [2025-03-04 06:52:19,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 442 transitions, 1156 flow [2025-03-04 06:52:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:19,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:19,075 INFO L175 Difference]: Start difference. First operand has 446 places, 440 transitions, 1073 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:19,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 442 transitions, 1156 flow [2025-03-04 06:52:19,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 442 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:19,084 INFO L231 Difference]: Finished difference. Result has 445 places, 439 transitions, 1071 flow [2025-03-04 06:52:19,084 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-04 06:52:19,085 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -79 predicate places. [2025-03-04 06:52:19,085 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 439 transitions, 1071 flow [2025-03-04 06:52:19,086 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-04 06:52:19,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:19,086 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-04 06:52:19,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:52:19,086 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-04 06:52:19,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1834530354, now seen corresponding path program 1 times [2025-03-04 06:52:19,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:19,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091017932] [2025-03-04 06:52:19,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:19,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:19,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:52:19,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:52:19,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:19,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:19,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:19,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091017932] [2025-03-04 06:52:19,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091017932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:19,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:19,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:19,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409742909] [2025-03-04 06:52:19,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:19,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:19,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:19,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:19,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:19,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:19,218 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-04 06:52:19,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:19,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:19,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:20,008 INFO L124 PetriNetUnfolderBase]: 365/4331 cut-off events. [2025-03-04 06:52:20,008 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2025-03-04 06:52:20,044 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-04 06:52:20,060 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/441 dead transitions. [2025-03-04 06:52:20,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 441 transitions, 1156 flow [2025-03-04 06:52:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:20,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:20,063 INFO L175 Difference]: Start difference. First operand has 445 places, 439 transitions, 1071 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:20,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 441 transitions, 1156 flow [2025-03-04 06:52:20,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 441 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:20,070 INFO L231 Difference]: Finished difference. Result has 444 places, 438 transitions, 1069 flow [2025-03-04 06:52:20,071 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-04 06:52:20,071 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -80 predicate places. [2025-03-04 06:52:20,071 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 438 transitions, 1069 flow [2025-03-04 06:52:20,072 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-04 06:52:20,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:20,072 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-04 06:52:20,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:52:20,072 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-04 06:52:20,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:20,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1735183959, now seen corresponding path program 1 times [2025-03-04 06:52:20,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:20,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123341707] [2025-03-04 06:52:20,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:20,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:52:20,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:52:20,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:20,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:20,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:20,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123341707] [2025-03-04 06:52:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123341707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:20,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:20,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293396191] [2025-03-04 06:52:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:20,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:20,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:20,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:20,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:20,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:20,192 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-04 06:52:20,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:20,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:20,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:20,860 INFO L124 PetriNetUnfolderBase]: 412/4330 cut-off events. [2025-03-04 06:52:20,860 INFO L125 PetriNetUnfolderBase]: For 414/417 co-relation queries the response was YES. [2025-03-04 06:52:20,921 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-04 06:52:20,941 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/440 dead transitions. [2025-03-04 06:52:20,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1156 flow [2025-03-04 06:52:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:20,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:20,943 INFO L175 Difference]: Start difference. First operand has 444 places, 438 transitions, 1069 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:20,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1156 flow [2025-03-04 06:52:20,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 440 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:20,950 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 1067 flow [2025-03-04 06:52:20,951 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-04 06:52:20,951 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -81 predicate places. [2025-03-04 06:52:20,951 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 1067 flow [2025-03-04 06:52:20,952 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-04 06:52:20,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:20,952 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-04 06:52:20,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:52:20,952 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-04 06:52:20,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:20,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1681512926, now seen corresponding path program 1 times [2025-03-04 06:52:20,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:20,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662018441] [2025-03-04 06:52:20,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:20,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:20,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 06:52:20,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 06:52:20,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:20,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:20,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:20,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662018441] [2025-03-04 06:52:20,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662018441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:20,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:20,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172326595] [2025-03-04 06:52:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:20,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:20,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:20,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:21,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:21,051 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-04 06:52:21,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:21,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:21,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:22,011 INFO L124 PetriNetUnfolderBase]: 754/5924 cut-off events. [2025-03-04 06:52:22,011 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-04 06:52:22,089 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-04 06:52:22,124 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/439 dead transitions. [2025-03-04 06:52:22,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 439 transitions, 1150 flow [2025-03-04 06:52:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:22,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:22,127 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 1067 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:22,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 439 transitions, 1150 flow [2025-03-04 06:52:22,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 439 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:22,138 INFO L231 Difference]: Finished difference. Result has 442 places, 436 transitions, 1065 flow [2025-03-04 06:52:22,139 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-04 06:52:22,139 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -82 predicate places. [2025-03-04 06:52:22,140 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 436 transitions, 1065 flow [2025-03-04 06:52:22,141 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-04 06:52:22,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:22,141 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-04 06:52:22,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:52:22,141 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-04 06:52:22,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1491525353, now seen corresponding path program 1 times [2025-03-04 06:52:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:22,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245071481] [2025-03-04 06:52:22,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:22,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 06:52:22,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 06:52:22,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:22,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245071481] [2025-03-04 06:52:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245071481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:22,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:22,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:22,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626484545] [2025-03-04 06:52:22,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:22,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:22,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:22,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:22,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:22,285 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-04 06:52:22,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:22,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:22,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:22,830 INFO L124 PetriNetUnfolderBase]: 235/3321 cut-off events. [2025-03-04 06:52:22,830 INFO L125 PetriNetUnfolderBase]: For 290/297 co-relation queries the response was YES. [2025-03-04 06:52:22,855 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-04 06:52:22,865 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/438 dead transitions. [2025-03-04 06:52:22,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 438 transitions, 1148 flow [2025-03-04 06:52:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:22,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:22,868 INFO L175 Difference]: Start difference. First operand has 442 places, 436 transitions, 1065 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:22,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 438 transitions, 1148 flow [2025-03-04 06:52:22,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 438 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:22,875 INFO L231 Difference]: Finished difference. Result has 441 places, 435 transitions, 1063 flow [2025-03-04 06:52:22,875 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-04 06:52:22,876 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -83 predicate places. [2025-03-04 06:52:22,876 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 435 transitions, 1063 flow [2025-03-04 06:52:22,877 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-04 06:52:22,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:22,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:22,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:52:22,877 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-04 06:52:22,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1838577318, now seen corresponding path program 1 times [2025-03-04 06:52:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:22,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747110115] [2025-03-04 06:52:22,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:22,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:22,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 06:52:22,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 06:52:22,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:22,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747110115] [2025-03-04 06:52:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747110115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:22,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:22,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:22,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759597007] [2025-03-04 06:52:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:22,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:22,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:22,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:22,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:22,981 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-04 06:52:22,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:22,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:22,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:23,652 INFO L124 PetriNetUnfolderBase]: 365/4283 cut-off events. [2025-03-04 06:52:23,652 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-04 06:52:23,710 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-04 06:52:23,733 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2025-03-04 06:52:23,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 437 transitions, 1148 flow [2025-03-04 06:52:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:23,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:23,735 INFO L175 Difference]: Start difference. First operand has 441 places, 435 transitions, 1063 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:23,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 437 transitions, 1148 flow [2025-03-04 06:52:23,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 437 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:23,743 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 1061 flow [2025-03-04 06:52:23,743 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-04 06:52:23,743 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -84 predicate places. [2025-03-04 06:52:23,744 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 1061 flow [2025-03-04 06:52:23,744 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-04 06:52:23,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:23,744 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-04 06:52:23,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:52:23,745 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-04 06:52:23,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1633765979, now seen corresponding path program 1 times [2025-03-04 06:52:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020320504] [2025-03-04 06:52:23,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:23,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:23,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:52:23,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:52:23,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:23,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:23,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:23,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020320504] [2025-03-04 06:52:23,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020320504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:23,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:23,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132529071] [2025-03-04 06:52:23,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:23,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:23,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:23,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:23,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:23,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:23,851 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-04 06:52:23,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:23,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:23,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:24,590 INFO L124 PetriNetUnfolderBase]: 412/4270 cut-off events. [2025-03-04 06:52:24,590 INFO L125 PetriNetUnfolderBase]: For 411/414 co-relation queries the response was YES. [2025-03-04 06:52:24,632 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-04 06:52:24,652 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-03-04 06:52:24,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 436 transitions, 1148 flow [2025-03-04 06:52:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:24,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:24,655 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 1061 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:24,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 436 transitions, 1148 flow [2025-03-04 06:52:24,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 436 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:24,662 INFO L231 Difference]: Finished difference. Result has 439 places, 433 transitions, 1059 flow [2025-03-04 06:52:24,662 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-04 06:52:24,663 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -85 predicate places. [2025-03-04 06:52:24,663 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 433 transitions, 1059 flow [2025-03-04 06:52:24,663 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-04 06:52:24,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:24,664 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-04 06:52:24,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:52:24,664 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-04 06:52:24,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:24,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1041439718, now seen corresponding path program 1 times [2025-03-04 06:52:24,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:24,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638975326] [2025-03-04 06:52:24,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:24,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 06:52:24,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 06:52:24,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:24,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:24,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:24,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638975326] [2025-03-04 06:52:24,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638975326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:24,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:24,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452206025] [2025-03-04 06:52:24,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:24,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:24,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:24,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:24,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:24,779 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-04 06:52:24,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:24,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:24,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:26,132 INFO L124 PetriNetUnfolderBase]: 766/6081 cut-off events. [2025-03-04 06:52:26,132 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-04 06:52:26,232 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-04 06:52:26,272 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-03-04 06:52:26,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1142 flow [2025-03-04 06:52:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:26,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:26,275 INFO L175 Difference]: Start difference. First operand has 439 places, 433 transitions, 1059 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:26,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1142 flow [2025-03-04 06:52:26,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 435 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:26,284 INFO L231 Difference]: Finished difference. Result has 438 places, 432 transitions, 1057 flow [2025-03-04 06:52:26,285 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-04 06:52:26,285 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -86 predicate places. [2025-03-04 06:52:26,285 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 432 transitions, 1057 flow [2025-03-04 06:52:26,286 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-04 06:52:26,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:26,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:26,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:52:26,286 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-04 06:52:26,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:26,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1391396429, now seen corresponding path program 1 times [2025-03-04 06:52:26,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:26,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472678433] [2025-03-04 06:52:26,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:26,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:26,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:52:26,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:52:26,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:26,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:26,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:26,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472678433] [2025-03-04 06:52:26,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472678433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:26,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:26,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832532232] [2025-03-04 06:52:26,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:26,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:26,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:26,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:26,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:26,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:26,402 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-04 06:52:26,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:26,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:26,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:26,880 INFO L124 PetriNetUnfolderBase]: 235/3319 cut-off events. [2025-03-04 06:52:26,881 INFO L125 PetriNetUnfolderBase]: For 290/294 co-relation queries the response was YES. [2025-03-04 06:52:26,922 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-04 06:52:26,934 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-03-04 06:52:26,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 434 transitions, 1140 flow [2025-03-04 06:52:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:26,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:26,936 INFO L175 Difference]: Start difference. First operand has 438 places, 432 transitions, 1057 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:26,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 434 transitions, 1140 flow [2025-03-04 06:52:26,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 434 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:26,942 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 1055 flow [2025-03-04 06:52:26,942 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-04 06:52:26,942 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -87 predicate places. [2025-03-04 06:52:26,943 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 1055 flow [2025-03-04 06:52:26,943 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-04 06:52:26,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:26,943 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-04 06:52:26,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:52:26,943 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-04 06:52:26,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash 966721882, now seen corresponding path program 1 times [2025-03-04 06:52:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:26,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570657813] [2025-03-04 06:52:26,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:26,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:52:26,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:52:26,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:26,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:26,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:26,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570657813] [2025-03-04 06:52:26,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570657813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:26,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:26,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:26,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950543863] [2025-03-04 06:52:26,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:26,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:26,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:26,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:27,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:27,040 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-04 06:52:27,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:27,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:27,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:27,612 INFO L124 PetriNetUnfolderBase]: 365/4235 cut-off events. [2025-03-04 06:52:27,612 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-04 06:52:27,664 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-04 06:52:27,681 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-03-04 06:52:27,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 433 transitions, 1140 flow [2025-03-04 06:52:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:27,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:27,684 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 1055 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:27,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 433 transitions, 1140 flow [2025-03-04 06:52:27,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 433 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:27,690 INFO L231 Difference]: Finished difference. Result has 436 places, 430 transitions, 1053 flow [2025-03-04 06:52:27,690 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-04 06:52:27,691 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -88 predicate places. [2025-03-04 06:52:27,691 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 430 transitions, 1053 flow [2025-03-04 06:52:27,691 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-04 06:52:27,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:27,691 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-04 06:52:27,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:52:27,691 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-04 06:52:27,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:27,692 INFO L85 PathProgramCache]: Analyzing trace with hash 62398499, now seen corresponding path program 1 times [2025-03-04 06:52:27,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:27,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078445151] [2025-03-04 06:52:27,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:27,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:27,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:52:27,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:52:27,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:27,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:27,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:27,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078445151] [2025-03-04 06:52:27,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078445151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:27,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:27,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114157069] [2025-03-04 06:52:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:27,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:27,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:27,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:27,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:27,803 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-04 06:52:27,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:27,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:27,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:28,365 INFO L124 PetriNetUnfolderBase]: 412/4210 cut-off events. [2025-03-04 06:52:28,365 INFO L125 PetriNetUnfolderBase]: For 408/411 co-relation queries the response was YES. [2025-03-04 06:52:28,441 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-04 06:52:28,461 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2025-03-04 06:52:28,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 432 transitions, 1140 flow [2025-03-04 06:52:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:28,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:28,464 INFO L175 Difference]: Start difference. First operand has 436 places, 430 transitions, 1053 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:28,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 432 transitions, 1140 flow [2025-03-04 06:52:28,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 432 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:28,470 INFO L231 Difference]: Finished difference. Result has 435 places, 429 transitions, 1051 flow [2025-03-04 06:52:28,471 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-04 06:52:28,471 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -89 predicate places. [2025-03-04 06:52:28,471 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 429 transitions, 1051 flow [2025-03-04 06:52:28,471 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-04 06:52:28,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:28,471 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-04 06:52:28,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:52:28,472 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-04 06:52:28,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:28,472 INFO L85 PathProgramCache]: Analyzing trace with hash 612064430, now seen corresponding path program 1 times [2025-03-04 06:52:28,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:28,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983546463] [2025-03-04 06:52:28,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:28,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:28,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:52:28,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:52:28,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:28,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:28,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:28,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983546463] [2025-03-04 06:52:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983546463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:28,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:28,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:28,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510224179] [2025-03-04 06:52:28,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:28,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:28,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:28,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:28,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:28,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:28,567 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-04 06:52:28,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:28,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:28,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:29,631 INFO L124 PetriNetUnfolderBase]: 778/6232 cut-off events. [2025-03-04 06:52:29,631 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-04 06:52:29,688 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-04 06:52:29,710 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/431 dead transitions. [2025-03-04 06:52:29,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 431 transitions, 1134 flow [2025-03-04 06:52:29,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:29,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:29,713 INFO L175 Difference]: Start difference. First operand has 435 places, 429 transitions, 1051 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:29,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 431 transitions, 1134 flow [2025-03-04 06:52:29,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 431 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:29,720 INFO L231 Difference]: Finished difference. Result has 434 places, 428 transitions, 1049 flow [2025-03-04 06:52:29,720 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-04 06:52:29,721 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -90 predicate places. [2025-03-04 06:52:29,721 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 428 transitions, 1049 flow [2025-03-04 06:52:29,721 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-04 06:52:29,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:29,721 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-04 06:52:29,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:52:29,721 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-04 06:52:29,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:29,722 INFO L85 PathProgramCache]: Analyzing trace with hash 21912629, now seen corresponding path program 1 times [2025-03-04 06:52:29,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:29,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80334476] [2025-03-04 06:52:29,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:29,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 06:52:29,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 06:52:29,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:29,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:29,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:29,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80334476] [2025-03-04 06:52:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80334476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:29,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:29,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974954305] [2025-03-04 06:52:29,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:29,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:29,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:29,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:29,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:29,828 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-04 06:52:29,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:29,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:29,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:30,199 INFO L124 PetriNetUnfolderBase]: 235/3275 cut-off events. [2025-03-04 06:52:30,199 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-04 06:52:30,236 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-04 06:52:30,246 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/430 dead transitions. [2025-03-04 06:52:30,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 430 transitions, 1132 flow [2025-03-04 06:52:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:30,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:30,248 INFO L175 Difference]: Start difference. First operand has 434 places, 428 transitions, 1049 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:30,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 430 transitions, 1132 flow [2025-03-04 06:52:30,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 430 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:30,254 INFO L231 Difference]: Finished difference. Result has 433 places, 427 transitions, 1047 flow [2025-03-04 06:52:30,254 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-04 06:52:30,254 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -91 predicate places. [2025-03-04 06:52:30,254 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 427 transitions, 1047 flow [2025-03-04 06:52:30,254 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-04 06:52:30,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:30,255 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-04 06:52:30,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 06:52:30,255 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-04 06:52:30,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1396210842, now seen corresponding path program 1 times [2025-03-04 06:52:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:30,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159924775] [2025-03-04 06:52:30,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:30,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 06:52:30,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 06:52:30,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:30,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:30,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:30,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159924775] [2025-03-04 06:52:30,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159924775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:30,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:30,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912786924] [2025-03-04 06:52:30,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:30,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:30,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:30,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:30,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:30,356 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-04 06:52:30,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:30,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:30,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:30,893 INFO L124 PetriNetUnfolderBase]: 365/4187 cut-off events. [2025-03-04 06:52:30,893 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-04 06:52:30,943 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-04 06:52:30,958 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2025-03-04 06:52:30,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 429 transitions, 1132 flow [2025-03-04 06:52:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:30,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:30,960 INFO L175 Difference]: Start difference. First operand has 433 places, 427 transitions, 1047 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:30,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 429 transitions, 1132 flow [2025-03-04 06:52:30,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 429 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:30,966 INFO L231 Difference]: Finished difference. Result has 432 places, 426 transitions, 1045 flow [2025-03-04 06:52:30,967 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-04 06:52:30,967 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -92 predicate places. [2025-03-04 06:52:30,967 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 426 transitions, 1045 flow [2025-03-04 06:52:30,967 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-04 06:52:30,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:30,967 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-04 06:52:30,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 06:52:30,967 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-04 06:52:30,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1366465905, now seen corresponding path program 1 times [2025-03-04 06:52:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:30,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329037051] [2025-03-04 06:52:30,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:30,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:30,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 06:52:30,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:52:30,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:30,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:30,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329037051] [2025-03-04 06:52:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329037051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:30,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:30,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:30,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500468349] [2025-03-04 06:52:30,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:30,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:30,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:30,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:30,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:31,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:31,064 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-04 06:52:31,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:31,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:31,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:31,747 INFO L124 PetriNetUnfolderBase]: 412/4150 cut-off events. [2025-03-04 06:52:31,747 INFO L125 PetriNetUnfolderBase]: For 405/408 co-relation queries the response was YES. [2025-03-04 06:52:31,777 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-04 06:52:31,789 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2025-03-04 06:52:31,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 428 transitions, 1132 flow [2025-03-04 06:52:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:31,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:31,791 INFO L175 Difference]: Start difference. First operand has 432 places, 426 transitions, 1045 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:31,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 428 transitions, 1132 flow [2025-03-04 06:52:31,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 428 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:31,796 INFO L231 Difference]: Finished difference. Result has 431 places, 425 transitions, 1043 flow [2025-03-04 06:52:31,796 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-04 06:52:31,796 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -93 predicate places. [2025-03-04 06:52:31,796 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 425 transitions, 1043 flow [2025-03-04 06:52:31,797 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-04 06:52:31,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:31,797 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-04 06:52:31,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 06:52:31,797 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-04 06:52:31,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1972209934, now seen corresponding path program 1 times [2025-03-04 06:52:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:31,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612703672] [2025-03-04 06:52:31,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:31,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:31,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 06:52:31,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 06:52:31,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:31,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:31,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:31,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612703672] [2025-03-04 06:52:31,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612703672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:31,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:31,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:31,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137884608] [2025-03-04 06:52:31,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:31,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:31,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:31,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:31,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:31,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:31,899 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-04 06:52:31,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:31,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:31,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:32,885 INFO L124 PetriNetUnfolderBase]: 790/6377 cut-off events. [2025-03-04 06:52:32,885 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-04 06:52:32,992 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-04 06:52:33,024 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2025-03-04 06:52:33,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 427 transitions, 1126 flow [2025-03-04 06:52:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:33,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:33,027 INFO L175 Difference]: Start difference. First operand has 431 places, 425 transitions, 1043 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:33,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 427 transitions, 1126 flow [2025-03-04 06:52:33,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 427 transitions, 1122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:33,035 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 1041 flow [2025-03-04 06:52:33,035 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-04 06:52:33,039 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -94 predicate places. [2025-03-04 06:52:33,039 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 1041 flow [2025-03-04 06:52:33,040 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-04 06:52:33,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:33,040 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-04 06:52:33,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 06:52:33,040 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-04 06:52:33,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:33,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1375623681, now seen corresponding path program 1 times [2025-03-04 06:52:33,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:33,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796611951] [2025-03-04 06:52:33,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:33,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:33,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 06:52:33,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 06:52:33,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:33,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796611951] [2025-03-04 06:52:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796611951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:33,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:33,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731657955] [2025-03-04 06:52:33,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:33,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:33,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:33,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:33,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:33,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:33,143 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-04 06:52:33,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:33,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:33,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:33,525 INFO L124 PetriNetUnfolderBase]: 235/3231 cut-off events. [2025-03-04 06:52:33,526 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-04 06:52:33,563 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-04 06:52:33,572 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/426 dead transitions. [2025-03-04 06:52:33,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 426 transitions, 1124 flow [2025-03-04 06:52:33,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:33,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:33,574 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 1041 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:33,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 426 transitions, 1124 flow [2025-03-04 06:52:33,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 426 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:33,579 INFO L231 Difference]: Finished difference. Result has 429 places, 423 transitions, 1039 flow [2025-03-04 06:52:33,579 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-04 06:52:33,580 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -95 predicate places. [2025-03-04 06:52:33,580 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 423 transitions, 1039 flow [2025-03-04 06:52:33,580 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-04 06:52:33,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:33,580 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-04 06:52:33,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 06:52:33,580 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-04 06:52:33,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1731823846, now seen corresponding path program 1 times [2025-03-04 06:52:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:33,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307293323] [2025-03-04 06:52:33,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:33,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:33,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 06:52:33,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 06:52:33,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:33,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307293323] [2025-03-04 06:52:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307293323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:33,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:33,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446358175] [2025-03-04 06:52:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:33,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:33,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:33,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:33,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:33,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:33,672 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-04 06:52:33,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:33,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:33,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:34,199 INFO L124 PetriNetUnfolderBase]: 365/4139 cut-off events. [2025-03-04 06:52:34,199 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-04 06:52:34,239 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-04 06:52:34,251 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/425 dead transitions. [2025-03-04 06:52:34,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 1124 flow [2025-03-04 06:52:34,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:34,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:34,253 INFO L175 Difference]: Start difference. First operand has 429 places, 423 transitions, 1039 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:34,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 1124 flow [2025-03-04 06:52:34,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 425 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:34,259 INFO L231 Difference]: Finished difference. Result has 428 places, 422 transitions, 1037 flow [2025-03-04 06:52:34,259 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-04 06:52:34,259 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -96 predicate places. [2025-03-04 06:52:34,259 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 422 transitions, 1037 flow [2025-03-04 06:52:34,260 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-04 06:52:34,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:34,260 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-04 06:52:34,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 06:52:34,260 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-04 06:52:34,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:34,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2125712913, now seen corresponding path program 1 times [2025-03-04 06:52:34,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:34,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010107925] [2025-03-04 06:52:34,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:34,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 06:52:34,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 06:52:34,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:34,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:34,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:34,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010107925] [2025-03-04 06:52:34,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010107925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:34,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:34,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:34,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610167009] [2025-03-04 06:52:34,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:34,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:34,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:34,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:34,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:34,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:34,359 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-04 06:52:34,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:34,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:34,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:34,913 INFO L124 PetriNetUnfolderBase]: 412/4090 cut-off events. [2025-03-04 06:52:34,914 INFO L125 PetriNetUnfolderBase]: For 402/405 co-relation queries the response was YES. [2025-03-04 06:52:34,971 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-04 06:52:34,987 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/424 dead transitions. [2025-03-04 06:52:34,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 424 transitions, 1124 flow [2025-03-04 06:52:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:34,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:34,989 INFO L175 Difference]: Start difference. First operand has 428 places, 422 transitions, 1037 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:34,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 424 transitions, 1124 flow [2025-03-04 06:52:34,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 424 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:34,994 INFO L231 Difference]: Finished difference. Result has 427 places, 421 transitions, 1035 flow [2025-03-04 06:52:34,995 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-04 06:52:34,995 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -97 predicate places. [2025-03-04 06:52:34,995 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 421 transitions, 1035 flow [2025-03-04 06:52:34,995 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-04 06:52:34,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:34,996 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-04 06:52:34,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 06:52:34,996 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-04 06:52:34,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:34,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1525570758, now seen corresponding path program 1 times [2025-03-04 06:52:34,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:34,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201599252] [2025-03-04 06:52:34,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:34,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:35,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 06:52:35,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 06:52:35,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:35,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:35,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:35,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201599252] [2025-03-04 06:52:35,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201599252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:35,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:35,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:35,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562543663] [2025-03-04 06:52:35,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:35,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:35,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:35,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:35,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:35,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:35,096 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-04 06:52:35,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:35,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:35,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:36,223 INFO L124 PetriNetUnfolderBase]: 802/6516 cut-off events. [2025-03-04 06:52:36,223 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-04 06:52:36,292 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-04 06:52:36,312 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-03-04 06:52:36,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 423 transitions, 1118 flow [2025-03-04 06:52:36,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:36,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:36,314 INFO L175 Difference]: Start difference. First operand has 427 places, 421 transitions, 1035 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:36,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 423 transitions, 1118 flow [2025-03-04 06:52:36,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 423 transitions, 1114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:36,320 INFO L231 Difference]: Finished difference. Result has 426 places, 420 transitions, 1033 flow [2025-03-04 06:52:36,320 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-04 06:52:36,320 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -98 predicate places. [2025-03-04 06:52:36,321 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 420 transitions, 1033 flow [2025-03-04 06:52:36,321 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-04 06:52:36,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:36,321 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-04 06:52:36,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 06:52:36,321 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-04 06:52:36,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:36,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1348814463, now seen corresponding path program 1 times [2025-03-04 06:52:36,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:36,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642499570] [2025-03-04 06:52:36,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:36,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:36,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 06:52:36,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:52:36,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:36,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:36,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642499570] [2025-03-04 06:52:36,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642499570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:36,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:36,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507436106] [2025-03-04 06:52:36,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:36,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:36,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:36,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:36,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:36,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:36,418 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-04 06:52:36,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:36,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:36,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:36,841 INFO L124 PetriNetUnfolderBase]: 235/3187 cut-off events. [2025-03-04 06:52:36,842 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-04 06:52:36,880 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-04 06:52:36,889 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-03-04 06:52:36,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 422 transitions, 1116 flow [2025-03-04 06:52:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:36,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:36,891 INFO L175 Difference]: Start difference. First operand has 426 places, 420 transitions, 1033 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:36,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 422 transitions, 1116 flow [2025-03-04 06:52:36,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 422 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:36,896 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 1031 flow [2025-03-04 06:52:36,897 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-04 06:52:36,897 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -99 predicate places. [2025-03-04 06:52:36,897 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 1031 flow [2025-03-04 06:52:36,897 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-04 06:52:36,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:36,897 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-04 06:52:36,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 06:52:36,897 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-04 06:52:36,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:36,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1118612850, now seen corresponding path program 1 times [2025-03-04 06:52:36,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:36,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031724091] [2025-03-04 06:52:36,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:36,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:36,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 06:52:36,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:52:36,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:36,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:36,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:36,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031724091] [2025-03-04 06:52:36,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031724091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:36,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:36,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382107451] [2025-03-04 06:52:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:36,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:36,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:36,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:36,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:36,982 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-04 06:52:36,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:36,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:36,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:37,527 INFO L124 PetriNetUnfolderBase]: 365/4091 cut-off events. [2025-03-04 06:52:37,527 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-04 06:52:37,575 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-04 06:52:37,588 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/421 dead transitions. [2025-03-04 06:52:37,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 421 transitions, 1116 flow [2025-03-04 06:52:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:37,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:37,589 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 1031 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:37,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 421 transitions, 1116 flow [2025-03-04 06:52:37,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 421 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:37,595 INFO L231 Difference]: Finished difference. Result has 424 places, 418 transitions, 1029 flow [2025-03-04 06:52:37,595 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-04 06:52:37,596 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -100 predicate places. [2025-03-04 06:52:37,596 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 418 transitions, 1029 flow [2025-03-04 06:52:37,596 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-04 06:52:37,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:37,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:37,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 06:52:37,596 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-04 06:52:37,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash 685098301, now seen corresponding path program 1 times [2025-03-04 06:52:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:37,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765463393] [2025-03-04 06:52:37,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:37,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 06:52:37,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 06:52:37,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:37,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:37,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:37,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765463393] [2025-03-04 06:52:37,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765463393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:37,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:37,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:37,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179522003] [2025-03-04 06:52:37,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:37,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:37,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:37,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:37,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:37,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:37,686 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-04 06:52:37,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:37,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:37,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:38,217 INFO L124 PetriNetUnfolderBase]: 412/4030 cut-off events. [2025-03-04 06:52:38,217 INFO L125 PetriNetUnfolderBase]: For 399/402 co-relation queries the response was YES. [2025-03-04 06:52:38,272 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-04 06:52:38,285 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2025-03-04 06:52:38,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1116 flow [2025-03-04 06:52:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:38,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:38,287 INFO L175 Difference]: Start difference. First operand has 424 places, 418 transitions, 1029 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:38,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1116 flow [2025-03-04 06:52:38,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 420 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:38,292 INFO L231 Difference]: Finished difference. Result has 423 places, 417 transitions, 1027 flow [2025-03-04 06:52:38,292 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-04 06:52:38,293 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -101 predicate places. [2025-03-04 06:52:38,293 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 417 transitions, 1027 flow [2025-03-04 06:52:38,293 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-04 06:52:38,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:38,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:38,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 06:52:38,294 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-04 06:52:38,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:38,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1021132290, now seen corresponding path program 1 times [2025-03-04 06:52:38,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:38,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109329011] [2025-03-04 06:52:38,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:38,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:38,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 06:52:38,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 06:52:38,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:38,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:38,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:38,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109329011] [2025-03-04 06:52:38,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109329011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:38,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:38,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:38,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195583621] [2025-03-04 06:52:38,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:38,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:38,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:38,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:38,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:38,383 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-04 06:52:38,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:38,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:38,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:39,619 INFO L124 PetriNetUnfolderBase]: 814/6649 cut-off events. [2025-03-04 06:52:39,620 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-04 06:52:39,721 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-04 06:52:39,745 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2025-03-04 06:52:39,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 419 transitions, 1110 flow [2025-03-04 06:52:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:39,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:39,746 INFO L175 Difference]: Start difference. First operand has 423 places, 417 transitions, 1027 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:39,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 419 transitions, 1110 flow [2025-03-04 06:52:39,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 419 transitions, 1106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:39,752 INFO L231 Difference]: Finished difference. Result has 422 places, 416 transitions, 1025 flow [2025-03-04 06:52:39,752 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-04 06:52:39,752 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -102 predicate places. [2025-03-04 06:52:39,752 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 416 transitions, 1025 flow [2025-03-04 06:52:39,753 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-04 06:52:39,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:39,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:39,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 06:52:39,753 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-04 06:52:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1284076107, now seen corresponding path program 1 times [2025-03-04 06:52:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356512321] [2025-03-04 06:52:39,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:39,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 06:52:39,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 06:52:39,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:39,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:39,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:39,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356512321] [2025-03-04 06:52:39,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356512321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:39,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:39,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:39,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644980644] [2025-03-04 06:52:39,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:39,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:39,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:39,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:39,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:39,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:39,843 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-04 06:52:39,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:39,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:39,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:40,297 INFO L124 PetriNetUnfolderBase]: 235/3143 cut-off events. [2025-03-04 06:52:40,297 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-04 06:52:40,335 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-04 06:52:40,345 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2025-03-04 06:52:40,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 418 transitions, 1108 flow [2025-03-04 06:52:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:40,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:40,347 INFO L175 Difference]: Start difference. First operand has 422 places, 416 transitions, 1025 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:40,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 418 transitions, 1108 flow [2025-03-04 06:52:40,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 418 transitions, 1104 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:40,352 INFO L231 Difference]: Finished difference. Result has 421 places, 415 transitions, 1023 flow [2025-03-04 06:52:40,353 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-04 06:52:40,353 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -103 predicate places. [2025-03-04 06:52:40,353 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 415 transitions, 1023 flow [2025-03-04 06:52:40,353 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-04 06:52:40,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:40,353 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-04 06:52:40,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 06:52:40,353 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-04 06:52:40,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:40,354 INFO L85 PathProgramCache]: Analyzing trace with hash -411499589, now seen corresponding path program 1 times [2025-03-04 06:52:40,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:40,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360332631] [2025-03-04 06:52:40,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:40,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:40,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 06:52:40,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 06:52:40,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:40,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:40,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:40,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360332631] [2025-03-04 06:52:40,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360332631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:40,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:40,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:40,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338282397] [2025-03-04 06:52:40,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:40,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:40,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:40,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:40,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:40,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-04 06:52:40,445 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-04 06:52:40,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:40,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-04 06:52:40,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:40,991 INFO L124 PetriNetUnfolderBase]: 412/3973 cut-off events. [2025-03-04 06:52:40,991 INFO L125 PetriNetUnfolderBase]: For 401/404 co-relation queries the response was YES. [2025-03-04 06:52:41,043 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-04 06:52:41,056 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2025-03-04 06:52:41,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 417 transitions, 1110 flow [2025-03-04 06:52:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-04 06:52:41,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-04 06:52:41,057 INFO L175 Difference]: Start difference. First operand has 421 places, 415 transitions, 1023 flow. Second operand 3 states and 1545 transitions. [2025-03-04 06:52:41,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 417 transitions, 1110 flow [2025-03-04 06:52:41,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 417 transitions, 1106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:41,063 INFO L231 Difference]: Finished difference. Result has 420 places, 414 transitions, 1021 flow [2025-03-04 06:52:41,063 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-04 06:52:41,063 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -104 predicate places. [2025-03-04 06:52:41,063 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 414 transitions, 1021 flow [2025-03-04 06:52:41,064 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-04 06:52:41,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:41,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:41,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 06:52:41,064 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-04 06:52:41,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1213462221, now seen corresponding path program 1 times [2025-03-04 06:52:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:41,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941091661] [2025-03-04 06:52:41,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:41,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:52:41,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:52:41,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:41,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:41,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:41,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941091661] [2025-03-04 06:52:41,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941091661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:41,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:41,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:41,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785947605] [2025-03-04 06:52:41,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:41,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:41,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:41,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:41,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-04 06:52:41,143 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-04 06:52:41,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:41,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-04 06:52:41,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:41,505 INFO L124 PetriNetUnfolderBase]: 235/3119 cut-off events. [2025-03-04 06:52:41,506 INFO L125 PetriNetUnfolderBase]: For 280/284 co-relation queries the response was YES. [2025-03-04 06:52:41,537 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-04 06:52:41,538 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 0 selfloop transitions, 0 changer transitions 416/416 dead transitions. [2025-03-04 06:52:41,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 416 transitions, 1104 flow [2025-03-04 06:52:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-04 06:52:41,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-04 06:52:41,539 INFO L175 Difference]: Start difference. First operand has 420 places, 414 transitions, 1021 flow. Second operand 3 states and 1547 transitions. [2025-03-04 06:52:41,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 416 transitions, 1104 flow [2025-03-04 06:52:41,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 416 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:41,543 INFO L231 Difference]: Finished difference. Result has 419 places, 0 transitions, 0 flow [2025-03-04 06:52:41,543 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-04 06:52:41,544 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -105 predicate places. [2025-03-04 06:52:41,544 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 0 transitions, 0 flow [2025-03-04 06:52:41,544 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-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (202 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (201 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (200 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (199 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (198 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (197 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (196 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (195 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (194 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (193 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (192 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (191 of 203 remaining) [2025-03-04 06:52:41,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (190 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (189 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (188 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (187 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (186 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (185 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (184 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (183 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (182 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (181 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (180 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (179 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (178 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (177 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (176 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (175 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (174 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (173 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (172 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (171 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (170 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (169 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (168 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (167 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (166 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (165 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (164 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (163 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (162 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (161 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (160 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (159 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (158 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (157 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (156 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (155 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (154 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (153 of 203 remaining) [2025-03-04 06:52:41,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (152 of 203 remaining) [2025-03-04 06:52:41,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (151 of 203 remaining) [2025-03-04 06:52:41,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (150 of 203 remaining) [2025-03-04 06:52:41,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (149 of 203 remaining) [2025-03-04 06:52:41,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (148 of 203 remaining) [2025-03-04 06:52:41,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (147 of 203 remaining) [2025-03-04 06:52:41,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (146 of 203 remaining) [2025-03-04 06:52:41,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (145 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (144 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (143 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (142 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (141 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (140 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (139 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (138 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (137 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (136 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (135 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (134 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (133 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (132 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (131 of 203 remaining) [2025-03-04 06:52:41,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (130 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (129 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (128 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (127 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (126 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (125 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (124 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (123 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (122 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (121 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (120 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (119 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (118 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (117 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (116 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (115 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (114 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (113 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (112 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (111 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (110 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (109 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (108 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (107 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (106 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (105 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (104 of 203 remaining) [2025-03-04 06:52:41,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (103 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (102 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (101 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (100 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (99 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (98 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (97 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (96 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (95 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (94 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (93 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (92 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (91 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (90 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (89 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (88 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (87 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (86 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (85 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (84 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (83 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (82 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (81 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (80 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (79 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (77 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (76 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (75 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (74 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (73 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (72 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (71 of 203 remaining) [2025-03-04 06:52:41,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 203 remaining) [2025-03-04 06:52:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 203 remaining) [2025-03-04 06:52:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (68 of 203 remaining) [2025-03-04 06:52:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (67 of 203 remaining) [2025-03-04 06:52:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (66 of 203 remaining) [2025-03-04 06:52:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (65 of 203 remaining) [2025-03-04 06:52:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (64 of 203 remaining) [2025-03-04 06:52:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (63 of 203 remaining) [2025-03-04 06:52:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (62 of 203 remaining) [2025-03-04 06:52:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (61 of 203 remaining) [2025-03-04 06:52:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (60 of 203 remaining) [2025-03-04 06:52:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (59 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (58 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (57 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (56 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (55 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (54 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (52 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (51 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (48 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (47 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (46 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (45 of 203 remaining) [2025-03-04 06:52:41,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (44 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (43 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (42 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (41 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (40 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (39 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (38 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (37 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (36 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (35 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (34 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (33 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (32 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (30 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (29 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (28 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (27 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (26 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (25 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (24 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (23 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (22 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (21 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (20 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (19 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (18 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (17 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (16 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (15 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (14 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 203 remaining) [2025-03-04 06:52:41,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 203 remaining) [2025-03-04 06:52:41,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (10 of 203 remaining) [2025-03-04 06:52:41,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (9 of 203 remaining) [2025-03-04 06:52:41,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (8 of 203 remaining) [2025-03-04 06:52:41,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 203 remaining) [2025-03-04 06:52:41,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 203 remaining) [2025-03-04 06:52:41,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 203 remaining) [2025-03-04 06:52:41,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 203 remaining) [2025-03-04 06:52:41,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 203 remaining) [2025-03-04 06:52:41,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 203 remaining) [2025-03-04 06:52:41,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 203 remaining) [2025-03-04 06:52:41,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 203 remaining) [2025-03-04 06:52:41,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 06:52:41,556 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-04 06:52:41,564 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:52:41,564 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:52:41,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:52:41 BasicIcfg [2025-03-04 06:52:41,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:52:41,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:52:41,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:52:41,571 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:52:41,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:10" (3/4) ... [2025-03-04 06:52:41,573 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:52:41,576 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:52:41,576 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:52:41,576 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:52:41,576 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-04 06:52:41,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 06:52:41,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:52:41,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 06:52:41,581 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:52:41,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:52:41,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:52:41,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:52:41,649 INFO L158 Benchmark]: Toolchain (without parser) took 31854.66ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 113.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 499.8MB. Max. memory is 16.1GB. [2025-03-04 06:52:41,650 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:52:41,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.62ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 100.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:41,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.76ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:52:41,651 INFO L158 Benchmark]: Boogie Preprocessor took 17.48ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:41,651 INFO L158 Benchmark]: IcfgBuilder took 603.98ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 64.0MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 06:52:41,652 INFO L158 Benchmark]: TraceAbstraction took 30937.11ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 63.5MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-03-04 06:52:41,654 INFO L158 Benchmark]: Witness Printer took 77.51ms. Allocated memory is still 2.4GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:41,655 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.14ms. Allocated memory is still 226.5MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.62ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 100.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.76ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.48ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 603.98ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 64.0MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30937.11ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 63.5MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 77.51ms. Allocated memory is still 2.4GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 4.2MB). 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: 30.8s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5794 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1900 mSDsluCounter, 984 SdHoareTripleChecker+Invalid, 2.5s 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-04 06:52:41,679 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