./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 f6a420ba5144c69cefe02db203552770c4018653c510d9792e57ffedc3dfc64e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:00:00,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:00:00,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:00:00,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:00:00,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:00:00,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:00:00,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:00:00,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:00:00,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:00:00,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:00:00,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:00:00,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:00:00,758 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:00:00,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:00:00,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:00:00,758 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:00:00,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:00:00,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:00:00,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:00:00,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:00:00,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:00:00,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:00:00,759 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:00:00,759 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:00:00,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:00:00,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:00:00,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:00:00,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:00:00,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:00:00,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:00:00,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:00:00,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:00:00,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:00:00,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:00:00,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:00:00,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:00:00,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:00:00,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:00:00,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:00:00,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:00:00,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:00:00,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:00:00,760 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-jdk21/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 -> f6a420ba5144c69cefe02db203552770c4018653c510d9792e57ffedc3dfc64e [2025-02-06 09:00:00,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:00:00,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:00:00,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:00:00,964 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:00:00,964 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:00:00,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.i [2025-02-06 09:00:02,099 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f786b927/23a0ae5d12624d3b8a4288c71b00e074/FLAG676499c40 [2025-02-06 09:00:02,447 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:00:02,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.i [2025-02-06 09:00:02,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f786b927/23a0ae5d12624d3b8a4288c71b00e074/FLAG676499c40 [2025-02-06 09:00:02,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f786b927/23a0ae5d12624d3b8a4288c71b00e074 [2025-02-06 09:00:02,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:00:02,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:00:02,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:00:02,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:00:02,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:00:02,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:02,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547a5ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02, skipping insertion in model container [2025-02-06 09:00:02,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:02,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:00:02,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:00:02,809 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:00:02,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:00:02,907 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:00:02,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02 WrapperNode [2025-02-06 09:00:02,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:00:02,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:00:02,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:00:02,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:00:02,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:02,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:02,984 INFO L138 Inliner]: procedures = 179, calls = 47, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 954 [2025-02-06 09:00:02,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:00:02,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:00:02,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:00:02,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:00:02,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:02,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:03,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:03,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:03,036 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:03,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:03,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:03,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:03,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:00:03,056 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:00:03,056 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:00:03,056 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:00:03,057 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (1/1) ... [2025-02-06 09:00:03,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:00:03,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:00:03,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:00:03,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:00:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:00:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 09:00:03,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 09:00:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:00:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 09:00:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:00:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:00:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:00:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:00:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 09:00:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:00:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:00:03,117 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:00:03,222 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:00:03,224 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:00:04,114 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:00:04,114 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:00:04,453 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:00:04,454 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:00:04,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:00:04 BoogieIcfgContainer [2025-02-06 09:00:04,454 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:00:04,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:00:04,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:00:04,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:00:04,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:00:02" (1/3) ... [2025-02-06 09:00:04,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d06494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:00:04, skipping insertion in model container [2025-02-06 09:00:04,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:02" (2/3) ... [2025-02-06 09:00:04,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d06494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:00:04, skipping insertion in model container [2025-02-06 09:00:04,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:00:04" (3/3) ... [2025-02-06 09:00:04,464 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-2.i [2025-02-06 09:00:04,487 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:00:04,492 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas_longer-2.i that has 2 procedures, 806 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-02-06 09:00:04,492 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:00:04,631 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:00:04,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 809 places, 814 transitions, 1632 flow [2025-02-06 09:00:04,956 INFO L124 PetriNetUnfolderBase]: 8/821 cut-off events. [2025-02-06 09:00:04,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:00:04,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 821 events. 8/821 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 261 event pairs, 0 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 151. Up to 3 conditions per place. [2025-02-06 09:00:04,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 809 places, 814 transitions, 1632 flow [2025-02-06 09:00:05,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 809 places, 814 transitions, 1632 flow [2025-02-06 09:00:05,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:00:05,023 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;@2bcefbca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:00:05,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-02-06 09:00:05,116 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:00:05,116 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-06 09:00:05,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:00:05,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:05,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:00:05,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-02-06 09:00:05,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1684654189, now seen corresponding path program 1 times [2025-02-06 09:00:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:05,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905922251] [2025-02-06 09:00:05,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:05,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-06 09:00:05,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-06 09:00:05,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:05,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:07,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:07,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905922251] [2025-02-06 09:00:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905922251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:07,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:07,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 09:00:07,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011383404] [2025-02-06 09:00:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:07,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:00:07,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:07,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:00:07,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:00:07,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 785 out of 814 [2025-02-06 09:00:07,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 809 places, 814 transitions, 1632 flow. Second operand has 2 states, 2 states have (on average 786.0) internal successors, (1572), 2 states have internal predecessors, (1572), 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-02-06 09:00:07,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:07,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 785 of 814 [2025-02-06 09:00:07,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:08,014 INFO L124 PetriNetUnfolderBase]: 6/792 cut-off events. [2025-02-06 09:00:08,014 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:00:08,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 792 events. 6/792 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 157 event pairs, 0 based on Foata normal form. 10/786 useless extension candidates. Maximal degree in co-relation 135. Up to 11 conditions per place. [2025-02-06 09:00:08,017 INFO L140 encePairwiseOnDemand]: 795/814 looper letters, 10 selfloop transitions, 0 changer transitions 0/789 dead transitions. [2025-02-06 09:00:08,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 787 places, 789 transitions, 1602 flow [2025-02-06 09:00:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:00:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:00:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1599 transitions. [2025-02-06 09:00:08,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9821867321867321 [2025-02-06 09:00:08,036 INFO L175 Difference]: Start difference. First operand has 809 places, 814 transitions, 1632 flow. Second operand 2 states and 1599 transitions. [2025-02-06 09:00:08,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 787 places, 789 transitions, 1602 flow [2025-02-06 09:00:08,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 787 places, 789 transitions, 1602 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:00:08,060 INFO L231 Difference]: Finished difference. Result has 787 places, 789 transitions, 1582 flow [2025-02-06 09:00:08,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=814, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=786, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1582, PETRI_PLACES=787, PETRI_TRANSITIONS=789} [2025-02-06 09:00:08,068 INFO L279 CegarLoopForPetriNet]: 809 programPoint places, -22 predicate places. [2025-02-06 09:00:08,069 INFO L471 AbstractCegarLoop]: Abstraction has has 787 places, 789 transitions, 1582 flow [2025-02-06 09:00:08,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 786.0) internal successors, (1572), 2 states have internal predecessors, (1572), 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-02-06 09:00:08,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:08,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:00:08,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:00:08,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-02-06 09:00:08,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash 250064663, now seen corresponding path program 1 times [2025-02-06 09:00:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:08,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175414810] [2025-02-06 09:00:08,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:08,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:08,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-06 09:00:08,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-06 09:00:08,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:08,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:08,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:08,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175414810] [2025-02-06 09:00:08,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175414810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:08,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:08,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143304176] [2025-02-06 09:00:08,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:08,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:08,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:08,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:08,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:08,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 781 out of 814 [2025-02-06 09:00:08,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 787 places, 789 transitions, 1582 flow. Second operand has 3 states, 3 states have (on average 782.3333333333334) internal successors, (2347), 3 states have internal predecessors, (2347), 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-02-06 09:00:08,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:08,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 781 of 814 [2025-02-06 09:00:08,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:09,085 INFO L124 PetriNetUnfolderBase]: 10/888 cut-off events. [2025-02-06 09:00:09,085 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:00:09,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 888 events. 10/888 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 471 event pairs, 0 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 911. Up to 12 conditions per place. [2025-02-06 09:00:09,094 INFO L140 encePairwiseOnDemand]: 811/814 looper letters, 19 selfloop transitions, 2 changer transitions 0/796 dead transitions. [2025-02-06 09:00:09,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 796 transitions, 1638 flow [2025-02-06 09:00:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2365 transitions. [2025-02-06 09:00:09,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9684684684684685 [2025-02-06 09:00:09,102 INFO L175 Difference]: Start difference. First operand has 787 places, 789 transitions, 1582 flow. Second operand 3 states and 2365 transitions. [2025-02-06 09:00:09,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 796 transitions, 1638 flow [2025-02-06 09:00:09,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 788 places, 796 transitions, 1638 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:00:09,122 INFO L231 Difference]: Finished difference. Result has 788 places, 788 transitions, 1584 flow [2025-02-06 09:00:09,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=814, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=786, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=788, PETRI_TRANSITIONS=788} [2025-02-06 09:00:09,123 INFO L279 CegarLoopForPetriNet]: 809 programPoint places, -21 predicate places. [2025-02-06 09:00:09,123 INFO L471 AbstractCegarLoop]: Abstraction has has 788 places, 788 transitions, 1584 flow [2025-02-06 09:00:09,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 782.3333333333334) internal successors, (2347), 3 states have internal predecessors, (2347), 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-02-06 09:00:09,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:09,128 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:00:09,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:00:09,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-02-06 09:00:09,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash -27084450, now seen corresponding path program 1 times [2025-02-06 09:00:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520064840] [2025-02-06 09:00:09,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:09,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:09,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-06 09:00:09,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-06 09:00:09,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:09,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:00:09,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:00:09,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-06 09:00:09,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-06 09:00:09,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:09,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:00:09,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:00:09,706 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:00:09,706 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-02-06 09:00:09,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-02-06 09:00:09,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-02-06 09:00:09,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-02-06 09:00:09,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-02-06 09:00:09,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-02-06 09:00:09,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2025-02-06 09:00:09,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-02-06 09:00:09,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-02-06 09:00:09,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-02-06 09:00:09,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-02-06 09:00:09,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-02-06 09:00:09,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-02-06 09:00:09,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-02-06 09:00:09,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-02-06 09:00:09,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-02-06 09:00:09,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-02-06 09:00:09,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-02-06 09:00:09,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-02-06 09:00:09,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-02-06 09:00:09,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-02-06 09:00:09,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-02-06 09:00:09,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-02-06 09:00:09,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-02-06 09:00:09,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-02-06 09:00:09,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-02-06 09:00:09,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:00:09,715 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 09:00:09,717 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:00:09,717 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:00:09,820 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:00:09,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 946 places, 957 transitions, 1924 flow [2025-02-06 09:00:10,008 INFO L124 PetriNetUnfolderBase]: 16/973 cut-off events. [2025-02-06 09:00:10,008 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:00:10,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 973 events. 16/973 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1003 event pairs, 0 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 822. Up to 3 conditions per place. [2025-02-06 09:00:10,018 INFO L82 GeneralOperation]: Start removeDead. Operand has 946 places, 957 transitions, 1924 flow [2025-02-06 09:00:10,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 946 places, 957 transitions, 1924 flow [2025-02-06 09:00:10,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:00:10,029 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;@2bcefbca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:00:10,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-02-06 09:00:10,102 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:00:10,103 INFO L124 PetriNetUnfolderBase]: 0/671 cut-off events. [2025-02-06 09:00:10,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:00:10,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:10,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:00:10,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-02-06 09:00:10,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash 190372606, now seen corresponding path program 1 times [2025-02-06 09:00:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:10,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782265123] [2025-02-06 09:00:10,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:10,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-06 09:00:10,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-06 09:00:10,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:10,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:11,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782265123] [2025-02-06 09:00:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782265123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:11,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:11,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 09:00:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686146263] [2025-02-06 09:00:11,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:11,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:00:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:11,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:00:11,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:00:11,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 900 out of 957 [2025-02-06 09:00:11,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 946 places, 957 transitions, 1924 flow. Second operand has 2 states, 2 states have (on average 901.0) internal successors, (1802), 2 states have internal predecessors, (1802), 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-02-06 09:00:11,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:11,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 900 of 957 [2025-02-06 09:00:11,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:12,167 INFO L124 PetriNetUnfolderBase]: 140/2048 cut-off events. [2025-02-06 09:00:12,167 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-06 09:00:12,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2252 conditions, 2048 events. 140/2048 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8934 event pairs, 52 based on Foata normal form. 111/1970 useless extension candidates. Maximal degree in co-relation 1410. Up to 178 conditions per place. [2025-02-06 09:00:12,242 INFO L140 encePairwiseOnDemand]: 920/957 looper letters, 20 selfloop transitions, 0 changer transitions 0/911 dead transitions. [2025-02-06 09:00:12,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 911 transitions, 1872 flow [2025-02-06 09:00:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:00:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:00:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1857 transitions. [2025-02-06 09:00:12,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9702194357366771 [2025-02-06 09:00:12,246 INFO L175 Difference]: Start difference. First operand has 946 places, 957 transitions, 1924 flow. Second operand 2 states and 1857 transitions. [2025-02-06 09:00:12,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 911 transitions, 1872 flow [2025-02-06 09:00:12,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 911 transitions, 1872 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:00:12,257 INFO L231 Difference]: Finished difference. Result has 905 places, 911 transitions, 1832 flow [2025-02-06 09:00:12,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=957, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=904, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=911, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1832, PETRI_PLACES=905, PETRI_TRANSITIONS=911} [2025-02-06 09:00:12,260 INFO L279 CegarLoopForPetriNet]: 946 programPoint places, -41 predicate places. [2025-02-06 09:00:12,260 INFO L471 AbstractCegarLoop]: Abstraction has has 905 places, 911 transitions, 1832 flow [2025-02-06 09:00:12,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 901.0) internal successors, (1802), 2 states have internal predecessors, (1802), 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-02-06 09:00:12,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:12,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:00:12,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:00:12,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-02-06 09:00:12,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1735414494, now seen corresponding path program 1 times [2025-02-06 09:00:12,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:12,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643547331] [2025-02-06 09:00:12,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:12,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-06 09:00:12,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-06 09:00:12,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:12,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:12,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:12,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643547331] [2025-02-06 09:00:12,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643547331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:12,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:12,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799857794] [2025-02-06 09:00:12,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:12,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:12,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:12,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:12,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:12,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 957 [2025-02-06 09:00:12,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 905 places, 911 transitions, 1832 flow. Second operand has 3 states, 3 states have (on average 893.3333333333334) internal successors, (2680), 3 states have internal predecessors, (2680), 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-02-06 09:00:12,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:12,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 957 [2025-02-06 09:00:12,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:13,487 INFO L124 PetriNetUnfolderBase]: 446/4639 cut-off events. [2025-02-06 09:00:13,488 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-06 09:00:13,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5311 conditions, 4639 events. 446/4639 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 35938 event pairs, 95 based on Foata normal form. 0/4111 useless extension candidates. Maximal degree in co-relation 5306. Up to 315 conditions per place. [2025-02-06 09:00:13,515 INFO L140 encePairwiseOnDemand]: 949/957 looper letters, 47 selfloop transitions, 6 changer transitions 0/936 dead transitions. [2025-02-06 09:00:13,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 907 places, 936 transitions, 1993 flow [2025-02-06 09:00:13,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2731 transitions. [2025-02-06 09:00:13,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9512365029606409 [2025-02-06 09:00:13,521 INFO L175 Difference]: Start difference. First operand has 905 places, 911 transitions, 1832 flow. Second operand 3 states and 2731 transitions. [2025-02-06 09:00:13,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 907 places, 936 transitions, 1993 flow [2025-02-06 09:00:13,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 907 places, 936 transitions, 1993 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:00:13,533 INFO L231 Difference]: Finished difference. Result has 909 places, 917 transitions, 1884 flow [2025-02-06 09:00:13,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=957, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=905, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=911, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1884, PETRI_PLACES=909, PETRI_TRANSITIONS=917} [2025-02-06 09:00:13,535 INFO L279 CegarLoopForPetriNet]: 946 programPoint places, -37 predicate places. [2025-02-06 09:00:13,535 INFO L471 AbstractCegarLoop]: Abstraction has has 909 places, 917 transitions, 1884 flow [2025-02-06 09:00:13,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 893.3333333333334) internal successors, (2680), 3 states have internal predecessors, (2680), 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-02-06 09:00:13,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:13,537 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:00:13,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:00:13,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-02-06 09:00:13,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1597402861, now seen corresponding path program 1 times [2025-02-06 09:00:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300483003] [2025-02-06 09:00:13,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:13,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:13,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-06 09:00:13,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-02-06 09:00:13,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:13,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:00:13,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:00:13,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-06 09:00:13,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-02-06 09:00:13,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:13,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:00:13,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:00:13,864 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:00:13,865 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2025-02-06 09:00:13,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2025-02-06 09:00:13,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2025-02-06 09:00:13,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2025-02-06 09:00:13,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2025-02-06 09:00:13,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2025-02-06 09:00:13,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2025-02-06 09:00:13,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2025-02-06 09:00:13,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2025-02-06 09:00:13,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2025-02-06 09:00:13,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2025-02-06 09:00:13,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2025-02-06 09:00:13,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2025-02-06 09:00:13,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2025-02-06 09:00:13,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2025-02-06 09:00:13,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2025-02-06 09:00:13,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2025-02-06 09:00:13,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2025-02-06 09:00:13,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2025-02-06 09:00:13,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2025-02-06 09:00:13,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2025-02-06 09:00:13,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2025-02-06 09:00:13,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2025-02-06 09:00:13,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2025-02-06 09:00:13,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2025-02-06 09:00:13,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2025-02-06 09:00:13,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2025-02-06 09:00:13,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:00:13,871 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 09:00:13,871 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:00:13,871 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:00:13,974 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:00:13,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1083 places, 1100 transitions, 2218 flow [2025-02-06 09:00:14,178 INFO L124 PetriNetUnfolderBase]: 24/1125 cut-off events. [2025-02-06 09:00:14,179 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:00:14,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 1125 events. 24/1125 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1937 event pairs, 0 based on Foata normal form. 0/1019 useless extension candidates. Maximal degree in co-relation 977. Up to 4 conditions per place. [2025-02-06 09:00:14,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 1083 places, 1100 transitions, 2218 flow [2025-02-06 09:00:14,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1083 places, 1100 transitions, 2218 flow [2025-02-06 09:00:14,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:00:14,205 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;@2bcefbca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:00:14,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-02-06 09:00:14,252 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:00:14,252 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-06 09:00:14,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:00:14,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:14,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:00:14,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-02-06 09:00:14,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1061996760, now seen corresponding path program 1 times [2025-02-06 09:00:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:14,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228301055] [2025-02-06 09:00:14,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:14,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:14,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-06 09:00:14,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-06 09:00:14,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:14,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:15,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:15,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228301055] [2025-02-06 09:00:15,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228301055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:15,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:15,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 09:00:15,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853768676] [2025-02-06 09:00:15,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:15,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:00:15,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:15,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:00:15,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:00:15,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1015 out of 1100 [2025-02-06 09:00:15,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1083 places, 1100 transitions, 2218 flow. Second operand has 2 states, 2 states have (on average 1016.0) internal successors, (2032), 2 states have internal predecessors, (2032), 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-02-06 09:00:15,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:15,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1015 of 1100 [2025-02-06 09:00:15,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:18,642 INFO L124 PetriNetUnfolderBase]: 2072/14054 cut-off events. [2025-02-06 09:00:18,643 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2025-02-06 09:00:18,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16749 conditions, 14054 events. 2072/14054 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 150853 event pairs, 962 based on Foata normal form. 1271/13533 useless extension candidates. Maximal degree in co-relation 14132. Up to 2424 conditions per place. [2025-02-06 09:00:18,771 INFO L140 encePairwiseOnDemand]: 1045/1100 looper letters, 30 selfloop transitions, 0 changer transitions 0/1033 dead transitions. [2025-02-06 09:00:18,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1033 transitions, 2144 flow [2025-02-06 09:00:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:00:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:00:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2115 transitions. [2025-02-06 09:00:18,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9613636363636363 [2025-02-06 09:00:18,775 INFO L175 Difference]: Start difference. First operand has 1083 places, 1100 transitions, 2218 flow. Second operand 2 states and 2115 transitions. [2025-02-06 09:00:18,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1033 transitions, 2144 flow [2025-02-06 09:00:18,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 1033 transitions, 2142 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 09:00:18,784 INFO L231 Difference]: Finished difference. Result has 1023 places, 1033 transitions, 2082 flow [2025-02-06 09:00:18,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1100, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1033, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1033, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2082, PETRI_PLACES=1023, PETRI_TRANSITIONS=1033} [2025-02-06 09:00:18,786 INFO L279 CegarLoopForPetriNet]: 1083 programPoint places, -60 predicate places. [2025-02-06 09:00:18,786 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1033 transitions, 2082 flow [2025-02-06 09:00:18,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1016.0) internal successors, (2032), 2 states have internal predecessors, (2032), 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-02-06 09:00:18,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:18,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:00:18,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:00:18,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-02-06 09:00:18,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1623190020, now seen corresponding path program 1 times [2025-02-06 09:00:18,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:18,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327771022] [2025-02-06 09:00:18,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:18,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-06 09:00:18,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-06 09:00:18,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:18,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:19,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327771022] [2025-02-06 09:00:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327771022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:19,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:19,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960161829] [2025-02-06 09:00:19,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:19,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:19,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:19,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:19,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:19,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1100 [2025-02-06 09:00:19,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1033 transitions, 2082 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 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-02-06 09:00:19,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:19,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1100 [2025-02-06 09:00:19,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:31,673 INFO L124 PetriNetUnfolderBase]: 10815/60511 cut-off events. [2025-02-06 09:00:31,674 INFO L125 PetriNetUnfolderBase]: For 733/733 co-relation queries the response was YES. [2025-02-06 09:00:32,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74790 conditions, 60511 events. 10815/60511 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 875058 event pairs, 2795 based on Foata normal form. 0/52251 useless extension candidates. Maximal degree in co-relation 74784. Up to 6883 conditions per place. [2025-02-06 09:00:32,421 INFO L140 encePairwiseOnDemand]: 1088/1100 looper letters, 71 selfloop transitions, 9 changer transitions 0/1071 dead transitions. [2025-02-06 09:00:32,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1071 transitions, 2328 flow [2025-02-06 09:00:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3092 transitions. [2025-02-06 09:00:32,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.936969696969697 [2025-02-06 09:00:32,427 INFO L175 Difference]: Start difference. First operand has 1023 places, 1033 transitions, 2082 flow. Second operand 3 states and 3092 transitions. [2025-02-06 09:00:32,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1071 transitions, 2328 flow [2025-02-06 09:00:32,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1071 transitions, 2328 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:00:32,438 INFO L231 Difference]: Finished difference. Result has 1027 places, 1042 transitions, 2160 flow [2025-02-06 09:00:32,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1100, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1033, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1024, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2160, PETRI_PLACES=1027, PETRI_TRANSITIONS=1042} [2025-02-06 09:00:32,441 INFO L279 CegarLoopForPetriNet]: 1083 programPoint places, -56 predicate places. [2025-02-06 09:00:32,441 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1042 transitions, 2160 flow [2025-02-06 09:00:32,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 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-02-06 09:00:32,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:32,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:00:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:00:32,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-02-06 09:00:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash -241809238, now seen corresponding path program 1 times [2025-02-06 09:00:32,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:32,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393990452] [2025-02-06 09:00:32,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:32,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-02-06 09:00:32,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-02-06 09:00:32,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:32,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:33,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:33,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393990452] [2025-02-06 09:00:33,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393990452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:33,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:33,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:00:33,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349520036] [2025-02-06 09:00:33,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:33,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:00:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:33,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:00:33,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:00:34,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 982 out of 1100 [2025-02-06 09:00:34,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1042 transitions, 2160 flow. Second operand has 6 states, 6 states have (on average 983.6666666666666) internal successors, (5902), 6 states have internal predecessors, (5902), 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-02-06 09:00:34,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:34,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 982 of 1100 [2025-02-06 09:00:34,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:38,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][838], [326#L793-2true, 1034#L785true, 1080#true, 37#L734-1true, Black: 1088#true, 1090#(= |#race~state~0| 0), 1084#true, 1093#true, 79#L785true, 1082#true, 1086#true]) [2025-02-06 09:00:38,464 INFO L294 olderBase$Statistics]: this new event has 723 ancestors and is cut-off event [2025-02-06 09:00:38,464 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-02-06 09:00:38,464 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-06 09:00:38,464 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-02-06 09:00:38,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 1034#L785true, 1080#true, Black: 1088#true, 1084#true, 1090#(= |#race~state~0| 0), 482#EBStack_init_returnLabel#1true, 1093#true, 79#L785true, 1082#true, 1086#true]) [2025-02-06 09:00:38,770 INFO L294 olderBase$Statistics]: this new event has 724 ancestors and is cut-off event [2025-02-06 09:00:38,770 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-02-06 09:00:38,771 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-02-06 09:00:38,771 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-06 09:00:39,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [654#L781true, 326#L793-2true, 1080#true, 1034#L785true, Black: 1088#true, 1090#(= |#race~state~0| 0), 1084#true, 79#L785true, 1093#true, 1082#true, 1086#true]) [2025-02-06 09:00:39,001 INFO L294 olderBase$Statistics]: this new event has 725 ancestors and is cut-off event [2025-02-06 09:00:39,001 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-02-06 09:00:39,001 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-06 09:00:39,001 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-02-06 09:00:40,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 1034#L785true, 1080#true, Black: 1088#true, 1084#true, 1090#(= |#race~state~0| 0), 727#L734-3true, 1093#true, 274#L782-2true, 1082#true, 1086#true]) [2025-02-06 09:00:40,560 INFO L294 olderBase$Statistics]: this new event has 730 ancestors and is cut-off event [2025-02-06 09:00:40,560 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-06 09:00:40,560 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-06 09:00:40,560 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-06 09:00:40,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 1034#L785true, 1080#true, Black: 1088#true, 1084#true, 1090#(= |#race~state~0| 0), 1093#true, 274#L782-2true, 304#L734-2true, 1082#true, 1086#true]) [2025-02-06 09:00:40,900 INFO L294 olderBase$Statistics]: this new event has 731 ancestors and is cut-off event [2025-02-06 09:00:40,900 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-06 09:00:40,900 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-06 09:00:40,900 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-06 09:00:41,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 1034#L785true, 1080#true, Black: 1088#true, 1084#true, 1090#(= |#race~state~0| 0), 1093#true, 274#L782-2true, 1082#true, 1086#true, 23#L734true]) [2025-02-06 09:00:41,251 INFO L294 olderBase$Statistics]: this new event has 732 ancestors and is cut-off event [2025-02-06 09:00:41,251 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-06 09:00:41,251 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-06 09:00:41,251 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-06 09:00:41,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 1080#true, 1034#L785true, Black: 1088#true, 1084#true, 1090#(= |#race~state~0| 0), 1093#true, 274#L782-2true, 330#L734-1true, 1082#true, 1086#true]) [2025-02-06 09:00:41,661 INFO L294 olderBase$Statistics]: this new event has 733 ancestors and is cut-off event [2025-02-06 09:00:41,661 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-06 09:00:41,661 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-06 09:00:41,661 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-06 09:00:44,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 1080#true, 1034#L785true, 124#L734-4true, Black: 1088#true, 1090#(= |#race~state~0| 0), 1084#true, 1093#true, 275#L723-2true, 1082#true, 1086#true]) [2025-02-06 09:00:44,350 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-02-06 09:00:44,351 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-06 09:00:44,351 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-06 09:00:44,351 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-02-06 09:00:44,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 57#L734-3true, 1034#L785true, 1080#true, Black: 1088#true, 1090#(= |#race~state~0| 0), 1084#true, 1093#true, 275#L723-2true, 1082#true, 1086#true]) [2025-02-06 09:00:44,618 INFO L294 olderBase$Statistics]: this new event has 738 ancestors and is cut-off event [2025-02-06 09:00:44,618 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-02-06 09:00:44,618 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-06 09:00:44,618 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-06 09:00:44,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 1034#L785true, 1080#true, Black: 1088#true, 1090#(= |#race~state~0| 0), 1084#true, 1093#true, 35#L734-2true, 275#L723-2true, 1082#true, 1086#true]) [2025-02-06 09:00:44,897 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-02-06 09:00:44,897 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-06 09:00:44,897 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-06 09:00:44,897 INFO L297 olderBase$Statistics]: existing Event has 739 ancestors and is cut-off event [2025-02-06 09:00:45,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 1034#L785true, 1080#true, Black: 1088#true, 1090#(= |#race~state~0| 0), 1084#true, 1093#true, 275#L723-2true, 1082#true, 825#L734true, 1086#true]) [2025-02-06 09:00:45,207 INFO L294 olderBase$Statistics]: this new event has 740 ancestors and is cut-off event [2025-02-06 09:00:45,207 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-06 09:00:45,207 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2025-02-06 09:00:45,207 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-06 09:00:45,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][838], [326#L793-2true, 1034#L785true, 1080#true, 37#L734-1true, Black: 1088#true, 1090#(= |#race~state~0| 0), 1084#true, 1093#true, 275#L723-2true, 1082#true, 1086#true]) [2025-02-06 09:00:45,537 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-06 09:00:45,537 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:45,537 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:45,537 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-06 09:00:45,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 1034#L785true, 1080#true, 37#L734-1true, Black: 1088#true, 1090#(= |#race~state~0| 0), 1084#true, 1093#true, 275#L723-2true, 1082#true, 1086#true]) [2025-02-06 09:00:45,537 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-06 09:00:45,537 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:45,537 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-06 09:00:45,537 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:45,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 1034#L785true, 1080#true, Black: 1088#true, 1090#(= |#race~state~0| 0), 1084#true, 1093#true, 834#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 275#L723-2true, 1082#true, 1086#true]) [2025-02-06 09:00:45,539 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-06 09:00:45,539 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:45,539 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:45,539 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-06 09:00:45,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4189] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, 1080#true, 1034#L785true, 124#L734-4true, Black: 1088#true, 1090#(= |#race~state~0| 0), 1084#true, 1093#true, 97#L725true, 1082#true, 1086#true]) [2025-02-06 09:00:45,549 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-06 09:00:45,549 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:45,549 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:45,549 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event