./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:45:05,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:45:05,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:45:05,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:45:05,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:45:05,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:45:05,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:45:05,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:45:05,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:45:05,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:45:05,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:45:05,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:45:05,213 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:45:05,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:45:05,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:45:05,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:45:05,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:45:05,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:45:05,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:45:05,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:45:05,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:45:05,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:45:05,214 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:45:05,214 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:45:05,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:45:05,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:45:05,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:45:05,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:45:05,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:45:05,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:45:05,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:45:05,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:05,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:45:05,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:45:05,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:45:05,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:45:05,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:45:05,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:45:05,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:45:05,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:45:05,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:45:05,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:45:05,216 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-03-14 01:45:05,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:45:05,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:45:05,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:45:05,443 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:45:05,443 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:45:05,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-03-14 01:45:06,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d39f036/7bb23b1f430040ecb79f42400d1aa6ee/FLAG2c7a45a97 [2025-03-14 01:45:06,884 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:45:06,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-03-14 01:45:06,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d39f036/7bb23b1f430040ecb79f42400d1aa6ee/FLAG2c7a45a97 [2025-03-14 01:45:06,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d39f036/7bb23b1f430040ecb79f42400d1aa6ee [2025-03-14 01:45:06,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:45:06,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:45:06,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:06,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:45:06,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:45:06,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:06" (1/1) ... [2025-03-14 01:45:06,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48fe83db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:06, skipping insertion in model container [2025-03-14 01:45:06,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:06" (1/1) ... [2025-03-14 01:45:06,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:45:07,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:07,085 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:45:07,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:07,120 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:45:07,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07 WrapperNode [2025-03-14 01:45:07,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:07,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:07,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:45:07,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:45:07,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (1/1) ... [2025-03-14 01:45:07,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (1/1) ... [2025-03-14 01:45:07,169 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 372 [2025-03-14 01:45:07,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:07,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:45:07,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:45:07,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:45:07,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (1/1) ... [2025-03-14 01:45:07,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (1/1) ... [2025-03-14 01:45:07,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (1/1) ... [2025-03-14 01:45:07,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (1/1) ... [2025-03-14 01:45:07,206 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (1/1) ... [2025-03-14 01:45:07,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (1/1) ... [2025-03-14 01:45:07,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (1/1) ... [2025-03-14 01:45:07,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (1/1) ... [2025-03-14 01:45:07,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:45:07,231 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:45:07,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:45:07,231 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:45:07,231 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (1/1) ... [2025-03-14 01:45:07,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:07,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:45:07,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:45:07,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:45:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:45:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:45:07,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:45:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:45:07,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:45:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:45:07,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:45:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:45:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:45:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:45:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:45:07,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:45:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:45:07,308 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:45:07,401 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:45:07,402 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:45:07,906 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:45:07,911 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:45:07,913 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:45:07,935 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:45:07,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:07 BoogieIcfgContainer [2025-03-14 01:45:07,935 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:45:07,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:45:07,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:45:07,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:45:07,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:45:06" (1/3) ... [2025-03-14 01:45:07,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e63bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:07, skipping insertion in model container [2025-03-14 01:45:07,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:07" (2/3) ... [2025-03-14 01:45:07,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e63bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:07, skipping insertion in model container [2025-03-14 01:45:07,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:07" (3/3) ... [2025-03-14 01:45:07,946 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-03-14 01:45:07,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:45:07,961 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 490 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2025-03-14 01:45:07,961 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:45:08,098 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:45:08,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 499 places, 515 transitions, 1051 flow [2025-03-14 01:45:08,299 INFO L124 PetriNetUnfolderBase]: 26/512 cut-off events. [2025-03-14 01:45:08,301 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:45:08,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 512 events. 26/512 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 902 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 336. Up to 2 conditions per place. [2025-03-14 01:45:08,314 INFO L82 GeneralOperation]: Start removeDead. Operand has 499 places, 515 transitions, 1051 flow [2025-03-14 01:45:08,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 468 transitions, 954 flow [2025-03-14 01:45:08,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:45:08,346 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;@539c2afa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:45:08,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-03-14 01:45:08,353 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:45:08,353 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-14 01:45:08,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:45:08,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:08,354 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] [2025-03-14 01:45:08,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:08,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:08,360 INFO L85 PathProgramCache]: Analyzing trace with hash 38306877, now seen corresponding path program 1 times [2025-03-14 01:45:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:08,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501410231] [2025-03-14 01:45:08,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:08,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:08,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:45:08,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:45:08,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:08,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501410231] [2025-03-14 01:45:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501410231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:08,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:08,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:08,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881436884] [2025-03-14 01:45:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:08,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:08,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:08,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:08,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 515 [2025-03-14 01:45:08,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 468 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:08,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:08,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 515 [2025-03-14 01:45:08,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:08,793 INFO L124 PetriNetUnfolderBase]: 33/1039 cut-off events. [2025-03-14 01:45:08,793 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-14 01:45:08,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1039 events. 33/1039 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5191 event pairs, 15 based on Foata normal form. 34/934 useless extension candidates. Maximal degree in co-relation 824. Up to 55 conditions per place. [2025-03-14 01:45:08,809 INFO L140 encePairwiseOnDemand]: 495/515 looper letters, 15 selfloop transitions, 2 changer transitions 6/450 dead transitions. [2025-03-14 01:45:08,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 450 transitions, 952 flow [2025-03-14 01:45:08,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-03-14 01:45:08,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449838187702265 [2025-03-14 01:45:08,829 INFO L175 Difference]: Start difference. First operand has 455 places, 468 transitions, 954 flow. Second operand 3 states and 1460 transitions. [2025-03-14 01:45:08,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 450 transitions, 952 flow [2025-03-14 01:45:08,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 940 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:45:08,843 INFO L231 Difference]: Finished difference. Result has 450 places, 444 transitions, 898 flow [2025-03-14 01:45:08,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=450, PETRI_TRANSITIONS=444} [2025-03-14 01:45:08,850 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-03-14 01:45:08,850 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 444 transitions, 898 flow [2025-03-14 01:45:08,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:08,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:08,851 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] [2025-03-14 01:45:08,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:45:08,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:08,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash -419822197, now seen corresponding path program 1 times [2025-03-14 01:45:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:08,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435354687] [2025-03-14 01:45:08,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:08,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:45:08,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:45:08,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:08,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:08,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:08,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435354687] [2025-03-14 01:45:08,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435354687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:08,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:08,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:08,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419132482] [2025-03-14 01:45:08,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:08,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:08,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:08,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:08,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:08,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 515 [2025-03-14 01:45:08,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 444 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:08,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:08,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 515 [2025-03-14 01:45:08,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:09,315 INFO L124 PetriNetUnfolderBase]: 100/2658 cut-off events. [2025-03-14 01:45:09,315 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:45:09,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 2658 events. 100/2658 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 19710 event pairs, 56 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 2797. Up to 152 conditions per place. [2025-03-14 01:45:09,337 INFO L140 encePairwiseOnDemand]: 508/515 looper letters, 18 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2025-03-14 01:45:09,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 438 transitions, 924 flow [2025-03-14 01:45:09,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2025-03-14 01:45:09,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9268608414239482 [2025-03-14 01:45:09,341 INFO L175 Difference]: Start difference. First operand has 450 places, 444 transitions, 898 flow. Second operand 3 states and 1432 transitions. [2025-03-14 01:45:09,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 438 transitions, 924 flow [2025-03-14 01:45:09,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 438 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:09,348 INFO L231 Difference]: Finished difference. Result has 438 places, 438 transitions, 884 flow [2025-03-14 01:45:09,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=438, PETRI_TRANSITIONS=438} [2025-03-14 01:45:09,349 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2025-03-14 01:45:09,349 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 438 transitions, 884 flow [2025-03-14 01:45:09,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:09,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:09,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:09,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:45:09,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:09,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:09,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1632594325, now seen corresponding path program 1 times [2025-03-14 01:45:09,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:09,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460052197] [2025-03-14 01:45:09,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:09,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:09,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:45:09,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:45:09,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:09,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:09,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:09,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460052197] [2025-03-14 01:45:09,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460052197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:09,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:09,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:09,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51422148] [2025-03-14 01:45:09,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:09,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:09,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:09,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:10,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 515 [2025-03-14 01:45:10,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 438 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:10,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:10,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 515 [2025-03-14 01:45:10,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:11,036 INFO L124 PetriNetUnfolderBase]: 1199/6236 cut-off events. [2025-03-14 01:45:11,036 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-03-14 01:45:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8056 conditions, 6236 events. 1199/6236 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 54480 event pairs, 864 based on Foata normal form. 0/5383 useless extension candidates. Maximal degree in co-relation 8025. Up to 1771 conditions per place. [2025-03-14 01:45:11,082 INFO L140 encePairwiseOnDemand]: 497/515 looper letters, 54 selfloop transitions, 15 changer transitions 0/435 dead transitions. [2025-03-14 01:45:11,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1016 flow [2025-03-14 01:45:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2604 transitions. [2025-03-14 01:45:11,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8427184466019417 [2025-03-14 01:45:11,091 INFO L175 Difference]: Start difference. First operand has 438 places, 438 transitions, 884 flow. Second operand 6 states and 2604 transitions. [2025-03-14 01:45:11,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1016 flow [2025-03-14 01:45:11,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:11,096 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 907 flow [2025-03-14 01:45:11,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=907, PETRI_PLACES=439, PETRI_TRANSITIONS=435} [2025-03-14 01:45:11,097 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2025-03-14 01:45:11,097 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 907 flow [2025-03-14 01:45:11,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:11,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:11,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:11,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:45:11,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:11,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1422463777, now seen corresponding path program 1 times [2025-03-14 01:45:11,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:11,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298006201] [2025-03-14 01:45:11,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:11,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:11,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:45:11,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:45:11,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:11,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:11,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298006201] [2025-03-14 01:45:11,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298006201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:11,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:11,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:11,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545423057] [2025-03-14 01:45:11,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:11,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:11,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:11,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:11,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:11,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-03-14 01:45:11,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 435 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:11,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:11,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-03-14 01:45:11,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:11,216 INFO L124 PetriNetUnfolderBase]: 13/623 cut-off events. [2025-03-14 01:45:11,216 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:45:11,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 623 events. 13/623 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1670 event pairs, 5 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 638. Up to 22 conditions per place. [2025-03-14 01:45:11,224 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-03-14 01:45:11,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 434 transitions, 931 flow [2025-03-14 01:45:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-03-14 01:45:11,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-03-14 01:45:11,228 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 907 flow. Second operand 3 states and 1451 transitions. [2025-03-14 01:45:11,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 434 transitions, 931 flow [2025-03-14 01:45:11,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 434 transitions, 901 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:11,235 INFO L231 Difference]: Finished difference. Result has 435 places, 434 transitions, 879 flow [2025-03-14 01:45:11,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=879, PETRI_PLACES=435, PETRI_TRANSITIONS=434} [2025-03-14 01:45:11,237 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -20 predicate places. [2025-03-14 01:45:11,237 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 434 transitions, 879 flow [2025-03-14 01:45:11,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:11,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:11,238 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] [2025-03-14 01:45:11,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:45:11,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:11,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash 863857740, now seen corresponding path program 1 times [2025-03-14 01:45:11,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:11,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703147971] [2025-03-14 01:45:11,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:11,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:11,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-14 01:45:11,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-14 01:45:11,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:11,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:11,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:11,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703147971] [2025-03-14 01:45:11,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703147971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:11,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:11,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:11,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432980773] [2025-03-14 01:45:11,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:11,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:11,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:11,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:11,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-03-14 01:45:11,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 434 transitions, 879 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:11,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:11,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-03-14 01:45:11,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:11,398 INFO L124 PetriNetUnfolderBase]: 14/563 cut-off events. [2025-03-14 01:45:11,398 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:45:11,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 563 events. 14/563 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1305 event pairs, 7 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 567. Up to 25 conditions per place. [2025-03-14 01:45:11,406 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-03-14 01:45:11,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 903 flow [2025-03-14 01:45:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-03-14 01:45:11,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-03-14 01:45:11,409 INFO L175 Difference]: Start difference. First operand has 435 places, 434 transitions, 879 flow. Second operand 3 states and 1451 transitions. [2025-03-14 01:45:11,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 903 flow [2025-03-14 01:45:11,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 433 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:11,418 INFO L231 Difference]: Finished difference. Result has 434 places, 433 transitions, 877 flow [2025-03-14 01:45:11,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=434, PETRI_TRANSITIONS=433} [2025-03-14 01:45:11,419 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2025-03-14 01:45:11,421 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 433 transitions, 877 flow [2025-03-14 01:45:11,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:11,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:11,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:11,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:45:11,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:11,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:11,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2004418844, now seen corresponding path program 1 times [2025-03-14 01:45:11,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:11,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909290770] [2025-03-14 01:45:11,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:11,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-14 01:45:11,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-14 01:45:11,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:11,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:11,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:11,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909290770] [2025-03-14 01:45:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909290770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:11,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:11,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:11,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128326149] [2025-03-14 01:45:11,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:11,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:11,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:11,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:11,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-03-14 01:45:11,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 433 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:11,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:11,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-03-14 01:45:11,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:11,542 INFO L124 PetriNetUnfolderBase]: 10/440 cut-off events. [2025-03-14 01:45:11,543 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:45:11,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 440 events. 10/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 797 event pairs, 4 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 438. Up to 20 conditions per place. [2025-03-14 01:45:11,548 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2025-03-14 01:45:11,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 432 transitions, 901 flow [2025-03-14 01:45:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-03-14 01:45:11,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-03-14 01:45:11,551 INFO L175 Difference]: Start difference. First operand has 434 places, 433 transitions, 877 flow. Second operand 3 states and 1451 transitions. [2025-03-14 01:45:11,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 432 transitions, 901 flow [2025-03-14 01:45:11,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 432 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:11,558 INFO L231 Difference]: Finished difference. Result has 433 places, 432 transitions, 875 flow [2025-03-14 01:45:11,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=433, PETRI_TRANSITIONS=432} [2025-03-14 01:45:11,560 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -22 predicate places. [2025-03-14 01:45:11,560 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 432 transitions, 875 flow [2025-03-14 01:45:11,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:11,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:11,561 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] [2025-03-14 01:45:11,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:45:11,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:11,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:11,562 INFO L85 PathProgramCache]: Analyzing trace with hash 566168262, now seen corresponding path program 1 times [2025-03-14 01:45:11,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:11,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872325067] [2025-03-14 01:45:11,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:11,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:11,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-14 01:45:11,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-14 01:45:11,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:11,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:11,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:11,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872325067] [2025-03-14 01:45:11,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872325067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:11,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:11,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:11,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196298023] [2025-03-14 01:45:11,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:11,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:11,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:11,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:11,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-14 01:45:11,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 432 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:11,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:11,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-14 01:45:11,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:11,730 INFO L124 PetriNetUnfolderBase]: 14/694 cut-off events. [2025-03-14 01:45:11,730 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:45:11,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 694 events. 14/694 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1802 event pairs, 2 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 701. Up to 12 conditions per place. [2025-03-14 01:45:11,740 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 10 selfloop transitions, 3 changer transitions 0/432 dead transitions. [2025-03-14 01:45:11,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 432 transitions, 903 flow [2025-03-14 01:45:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1458 transitions. [2025-03-14 01:45:11,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9436893203883495 [2025-03-14 01:45:11,743 INFO L175 Difference]: Start difference. First operand has 433 places, 432 transitions, 875 flow. Second operand 3 states and 1458 transitions. [2025-03-14 01:45:11,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 432 transitions, 903 flow [2025-03-14 01:45:11,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 432 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:11,748 INFO L231 Difference]: Finished difference. Result has 431 places, 430 transitions, 873 flow [2025-03-14 01:45:11,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=873, PETRI_PLACES=431, PETRI_TRANSITIONS=430} [2025-03-14 01:45:11,749 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -24 predicate places. [2025-03-14 01:45:11,749 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 430 transitions, 873 flow [2025-03-14 01:45:11,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:11,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:11,750 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] [2025-03-14 01:45:11,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:45:11,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:11,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:11,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1373114265, now seen corresponding path program 1 times [2025-03-14 01:45:11,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:11,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152617221] [2025-03-14 01:45:11,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:11,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:11,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-14 01:45:11,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-14 01:45:11,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:11,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:11,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:11,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152617221] [2025-03-14 01:45:11,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152617221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:11,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:11,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276219112] [2025-03-14 01:45:11,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:11,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:11,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:11,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:11,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:11,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-14 01:45:11,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 430 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:11,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:11,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-14 01:45:11,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:11,979 INFO L124 PetriNetUnfolderBase]: 31/1093 cut-off events. [2025-03-14 01:45:11,979 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-14 01:45:11,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 1093 events. 31/1093 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4660 event pairs, 2 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1137. Up to 46 conditions per place. [2025-03-14 01:45:11,991 INFO L140 encePairwiseOnDemand]: 511/515 looper letters, 16 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-03-14 01:45:11,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 435 transitions, 924 flow [2025-03-14 01:45:11,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2025-03-14 01:45:11,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946925566343042 [2025-03-14 01:45:11,995 INFO L175 Difference]: Start difference. First operand has 431 places, 430 transitions, 873 flow. Second operand 3 states and 1463 transitions. [2025-03-14 01:45:11,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 435 transitions, 924 flow [2025-03-14 01:45:11,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 435 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:12,004 INFO L231 Difference]: Finished difference. Result has 430 places, 430 transitions, 877 flow [2025-03-14 01:45:12,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=430, PETRI_TRANSITIONS=430} [2025-03-14 01:45:12,006 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2025-03-14 01:45:12,006 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 430 transitions, 877 flow [2025-03-14 01:45:12,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:12,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:12,007 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] [2025-03-14 01:45:12,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:45:12,009 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:12,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1669764731, now seen corresponding path program 1 times [2025-03-14 01:45:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:12,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569301150] [2025-03-14 01:45:12,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:12,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-14 01:45:12,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-14 01:45:12,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:12,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569301150] [2025-03-14 01:45:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569301150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:12,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055682965] [2025-03-14 01:45:12,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:12,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:12,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:12,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:12,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:12,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-14 01:45:12,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 430 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:12,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:12,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-14 01:45:12,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:12,228 INFO L124 PetriNetUnfolderBase]: 24/944 cut-off events. [2025-03-14 01:45:12,229 INFO L125 PetriNetUnfolderBase]: For 10/28 co-relation queries the response was YES. [2025-03-14 01:45:12,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 944 events. 24/944 cut-off events. For 10/28 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3329 event pairs, 3 based on Foata normal form. 4/856 useless extension candidates. Maximal degree in co-relation 974. Up to 19 conditions per place. [2025-03-14 01:45:12,241 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 9 selfloop transitions, 2 changer transitions 4/430 dead transitions. [2025-03-14 01:45:12,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 430 transitions, 903 flow [2025-03-14 01:45:12,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2025-03-14 01:45:12,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943042071197411 [2025-03-14 01:45:12,245 INFO L175 Difference]: Start difference. First operand has 430 places, 430 transitions, 877 flow. Second operand 3 states and 1457 transitions. [2025-03-14 01:45:12,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 430 transitions, 903 flow [2025-03-14 01:45:12,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 430 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:45:12,252 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 869 flow [2025-03-14 01:45:12,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2025-03-14 01:45:12,254 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2025-03-14 01:45:12,254 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 869 flow [2025-03-14 01:45:12,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:12,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:12,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:12,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:45:12,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:12,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1538830762, now seen corresponding path program 1 times [2025-03-14 01:45:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:12,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119114854] [2025-03-14 01:45:12,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:12,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:12,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-14 01:45:12,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-14 01:45:12,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:12,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:12,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119114854] [2025-03-14 01:45:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119114854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:12,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:12,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:45:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27383621] [2025-03-14 01:45:12,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:12,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:45:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:12,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:45:12,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:45:12,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-03-14 01:45:12,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 869 flow. Second operand has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:12,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:12,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-03-14 01:45:12,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:12,925 INFO L124 PetriNetUnfolderBase]: 37/1068 cut-off events. [2025-03-14 01:45:12,925 INFO L125 PetriNetUnfolderBase]: For 7/31 co-relation queries the response was YES. [2025-03-14 01:45:12,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 1068 events. 37/1068 cut-off events. For 7/31 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3874 event pairs, 14 based on Foata normal form. 4/1006 useless extension candidates. Maximal degree in co-relation 1209. Up to 51 conditions per place. [2025-03-14 01:45:12,934 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/467 dead transitions. [2025-03-14 01:45:12,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 467 transitions, 1127 flow [2025-03-14 01:45:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:45:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:45:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-03-14 01:45:12,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-03-14 01:45:12,942 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 869 flow. Second operand 10 states and 4633 transitions. [2025-03-14 01:45:12,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 467 transitions, 1127 flow [2025-03-14 01:45:12,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 467 transitions, 1123 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:12,948 INFO L231 Difference]: Finished difference. Result has 437 places, 449 transitions, 1057 flow [2025-03-14 01:45:12,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1057, PETRI_PLACES=437, PETRI_TRANSITIONS=449} [2025-03-14 01:45:12,949 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -18 predicate places. [2025-03-14 01:45:12,949 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 449 transitions, 1057 flow [2025-03-14 01:45:12,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:12,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:12,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:12,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:45:12,951 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:12,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:12,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1673896710, now seen corresponding path program 1 times [2025-03-14 01:45:12,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:12,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586963968] [2025-03-14 01:45:12,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:12,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:12,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-14 01:45:12,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-14 01:45:12,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:12,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:13,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:13,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586963968] [2025-03-14 01:45:13,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586963968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:13,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:13,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:13,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102340928] [2025-03-14 01:45:13,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:13,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:13,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:13,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:13,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:13,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-14 01:45:13,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 449 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:13,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:13,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-14 01:45:13,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:13,338 INFO L124 PetriNetUnfolderBase]: 113/3049 cut-off events. [2025-03-14 01:45:13,338 INFO L125 PetriNetUnfolderBase]: For 59/63 co-relation queries the response was YES. [2025-03-14 01:45:13,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 3049 events. 113/3049 cut-off events. For 59/63 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 19832 event pairs, 11 based on Foata normal form. 0/2759 useless extension candidates. Maximal degree in co-relation 3317. Up to 144 conditions per place. [2025-03-14 01:45:13,365 INFO L140 encePairwiseOnDemand]: 511/515 looper letters, 15 selfloop transitions, 2 changer transitions 0/453 dead transitions. [2025-03-14 01:45:13,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 453 transitions, 1103 flow [2025-03-14 01:45:13,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2025-03-14 01:45:13,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9462783171521035 [2025-03-14 01:45:13,367 INFO L175 Difference]: Start difference. First operand has 437 places, 449 transitions, 1057 flow. Second operand 3 states and 1462 transitions. [2025-03-14 01:45:13,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 453 transitions, 1103 flow [2025-03-14 01:45:13,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 453 transitions, 1103 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:45:13,373 INFO L231 Difference]: Finished difference. Result has 438 places, 449 transitions, 1067 flow [2025-03-14 01:45:13,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1067, PETRI_PLACES=438, PETRI_TRANSITIONS=449} [2025-03-14 01:45:13,375 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2025-03-14 01:45:13,375 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 449 transitions, 1067 flow [2025-03-14 01:45:13,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:13,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:13,376 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] [2025-03-14 01:45:13,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:45:13,376 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:13,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:13,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1507872942, now seen corresponding path program 1 times [2025-03-14 01:45:13,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:13,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802905367] [2025-03-14 01:45:13,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:13,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-14 01:45:13,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-14 01:45:13,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:13,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:13,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:13,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802905367] [2025-03-14 01:45:13,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802905367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:13,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:13,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:13,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943406028] [2025-03-14 01:45:13,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:13,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:13,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:13,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:13,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-14 01:45:13,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 449 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:13,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:13,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-14 01:45:13,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:13,670 INFO L124 PetriNetUnfolderBase]: 102/2072 cut-off events. [2025-03-14 01:45:13,671 INFO L125 PetriNetUnfolderBase]: For 80/90 co-relation queries the response was YES. [2025-03-14 01:45:13,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 2072 events. 102/2072 cut-off events. For 80/90 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 11411 event pairs, 2 based on Foata normal form. 0/1906 useless extension candidates. Maximal degree in co-relation 2365. Up to 124 conditions per place. [2025-03-14 01:45:13,683 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 14 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2025-03-14 01:45:13,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 451 transitions, 1104 flow [2025-03-14 01:45:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-03-14 01:45:13,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449838187702265 [2025-03-14 01:45:13,685 INFO L175 Difference]: Start difference. First operand has 438 places, 449 transitions, 1067 flow. Second operand 3 states and 1460 transitions. [2025-03-14 01:45:13,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 451 transitions, 1104 flow [2025-03-14 01:45:13,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 451 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:45:13,691 INFO L231 Difference]: Finished difference. Result has 439 places, 448 transitions, 1070 flow [2025-03-14 01:45:13,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=439, PETRI_TRANSITIONS=448} [2025-03-14 01:45:13,692 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2025-03-14 01:45:13,692 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 448 transitions, 1070 flow [2025-03-14 01:45:13,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:13,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:13,693 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] [2025-03-14 01:45:13,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:45:13,693 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:13,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash 56070121, now seen corresponding path program 1 times [2025-03-14 01:45:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560462141] [2025-03-14 01:45:13,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:13,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-14 01:45:13,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-14 01:45:13,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:13,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:13,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:13,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560462141] [2025-03-14 01:45:13,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560462141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:13,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:13,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:45:13,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743871336] [2025-03-14 01:45:13,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:13,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:45:13,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:13,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:45:13,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:45:14,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-03-14 01:45:14,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 448 transitions, 1070 flow. Second operand has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:14,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:14,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-03-14 01:45:14,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:14,282 INFO L124 PetriNetUnfolderBase]: 73/1499 cut-off events. [2025-03-14 01:45:14,282 INFO L125 PetriNetUnfolderBase]: For 103/173 co-relation queries the response was YES. [2025-03-14 01:45:14,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1499 events. 73/1499 cut-off events. For 103/173 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7106 event pairs, 28 based on Foata normal form. 4/1395 useless extension candidates. Maximal degree in co-relation 1803. Up to 99 conditions per place. [2025-03-14 01:45:14,297 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/468 dead transitions. [2025-03-14 01:45:14,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 468 transitions, 1302 flow [2025-03-14 01:45:14,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:45:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:45:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-03-14 01:45:14,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-03-14 01:45:14,303 INFO L175 Difference]: Start difference. First operand has 439 places, 448 transitions, 1070 flow. Second operand 10 states and 4633 transitions. [2025-03-14 01:45:14,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 468 transitions, 1302 flow [2025-03-14 01:45:14,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 468 transitions, 1302 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:45:14,310 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 1175 flow [2025-03-14 01:45:14,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1175, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2025-03-14 01:45:14,311 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-03-14 01:45:14,312 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 1175 flow [2025-03-14 01:45:14,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:14,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:14,313 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] [2025-03-14 01:45:14,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:45:14,313 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:14,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash -87464138, now seen corresponding path program 1 times [2025-03-14 01:45:14,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:14,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263674876] [2025-03-14 01:45:14,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:14,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:14,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-14 01:45:14,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-14 01:45:14,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:14,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:14,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:14,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263674876] [2025-03-14 01:45:14,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263674876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:14,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:14,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:45:14,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961317737] [2025-03-14 01:45:14,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:14,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:45:14,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:14,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:45:14,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:45:14,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-03-14 01:45:14,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 1175 flow. Second operand has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:14,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:14,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-03-14 01:45:14,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:15,054 INFO L124 PetriNetUnfolderBase]: 72/1494 cut-off events. [2025-03-14 01:45:15,055 INFO L125 PetriNetUnfolderBase]: For 169/176 co-relation queries the response was YES. [2025-03-14 01:45:15,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1494 events. 72/1494 cut-off events. For 169/176 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6873 event pairs, 29 based on Foata normal form. 3/1400 useless extension candidates. Maximal degree in co-relation 1837. Up to 98 conditions per place. [2025-03-14 01:45:15,070 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/470 dead transitions. [2025-03-14 01:45:15,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 470 transitions, 1407 flow [2025-03-14 01:45:15,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:45:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:45:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-03-14 01:45:15,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-03-14 01:45:15,079 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 1175 flow. Second operand 10 states and 4633 transitions. [2025-03-14 01:45:15,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 470 transitions, 1407 flow [2025-03-14 01:45:15,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 470 transitions, 1334 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-14 01:45:15,088 INFO L231 Difference]: Finished difference. Result has 454 places, 452 transitions, 1207 flow [2025-03-14 01:45:15,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1207, PETRI_PLACES=454, PETRI_TRANSITIONS=452} [2025-03-14 01:45:15,090 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -1 predicate places. [2025-03-14 01:45:15,091 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 452 transitions, 1207 flow [2025-03-14 01:45:15,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:15,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:15,092 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] [2025-03-14 01:45:15,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:45:15,092 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:15,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:15,093 INFO L85 PathProgramCache]: Analyzing trace with hash -915325476, now seen corresponding path program 1 times [2025-03-14 01:45:15,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:15,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126307406] [2025-03-14 01:45:15,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:15,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:15,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-14 01:45:15,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-14 01:45:15,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:15,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:15,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:15,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126307406] [2025-03-14 01:45:15,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126307406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:15,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:15,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760837003] [2025-03-14 01:45:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:15,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:15,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:15,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:15,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-14 01:45:15,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 452 transitions, 1207 flow. Second operand has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:15,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:15,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-14 01:45:15,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:15,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1227] L68-22-->L68-20: Formula: (= |v_#race~csum~0_6| 0) InVars {} OutVars{#race~csum~0=|v_#race~csum~0_6|} AuxVars[] AssignedVars[#race~csum~0][403], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 545#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 73#L68-20true, Black: 538#(<= ~N~0 0), Black: 539#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 602#(= |#race~csum~0| 0), Black: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 90#L88true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 581#true, 562#true]) [2025-03-14 01:45:15,292 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2025-03-14 01:45:15,292 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-03-14 01:45:15,292 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-03-14 01:45:15,292 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-03-14 01:45:15,304 INFO L124 PetriNetUnfolderBase]: 48/1185 cut-off events. [2025-03-14 01:45:15,304 INFO L125 PetriNetUnfolderBase]: For 94/98 co-relation queries the response was YES. [2025-03-14 01:45:15,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1185 events. 48/1185 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4395 event pairs, 3 based on Foata normal form. 6/1127 useless extension candidates. Maximal degree in co-relation 1423. Up to 37 conditions per place. [2025-03-14 01:45:15,321 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 8 selfloop transitions, 2 changer transitions 28/452 dead transitions. [2025-03-14 01:45:15,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1233 flow [2025-03-14 01:45:15,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2025-03-14 01:45:15,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943042071197411 [2025-03-14 01:45:15,324 INFO L175 Difference]: Start difference. First operand has 454 places, 452 transitions, 1207 flow. Second operand 3 states and 1457 transitions. [2025-03-14 01:45:15,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1233 flow [2025-03-14 01:45:15,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 452 transitions, 1160 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-14 01:45:15,334 INFO L231 Difference]: Finished difference. Result has 447 places, 422 transitions, 975 flow [2025-03-14 01:45:15,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=447, PETRI_TRANSITIONS=422} [2025-03-14 01:45:15,335 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2025-03-14 01:45:15,336 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 422 transitions, 975 flow [2025-03-14 01:45:15,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:15,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:15,336 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] [2025-03-14 01:45:15,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:45:15,337 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:15,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1013055407, now seen corresponding path program 1 times [2025-03-14 01:45:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:15,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673483202] [2025-03-14 01:45:15,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:15,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:15,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-14 01:45:15,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-14 01:45:15,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:15,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:45:15,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:15,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673483202] [2025-03-14 01:45:15,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673483202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:15,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:15,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:15,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353794869] [2025-03-14 01:45:15,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:15,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:15,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:15,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:15,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:16,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-14 01:45:16,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 422 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:16,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:16,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-14 01:45:16,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:16,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 545#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 538#(<= ~N~0 0), Black: 539#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 600#true, Black: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 90#L88true, 603#true, Black: 586#(<= ~N~0 0), 507#(= |#race~N~0| 0), Black: 587#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~N~0 0)), 528#(= |#race~A~0| 0), 430#L67-7true, 562#true]) [2025-03-14 01:45:16,482 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2025-03-14 01:45:16,482 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:45:16,482 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-14 01:45:16,482 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:45:16,697 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 545#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 538#(<= ~N~0 0), Black: 539#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 600#true, Black: 554#true, Black: 526#true, Black: 558#true, 556#(= |#race~B~0| 0), 603#true, 90#L88true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 430#L67-7true, 562#true]) [2025-03-14 01:45:16,698 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-03-14 01:45:16,698 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:45:16,698 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-03-14 01:45:16,698 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-14 01:45:16,698 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:45:16,710 INFO L124 PetriNetUnfolderBase]: 203/3554 cut-off events. [2025-03-14 01:45:16,711 INFO L125 PetriNetUnfolderBase]: For 56/77 co-relation queries the response was YES. [2025-03-14 01:45:16,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 3554 events. 203/3554 cut-off events. For 56/77 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 25962 event pairs, 44 based on Foata normal form. 4/3276 useless extension candidates. Maximal degree in co-relation 4196. Up to 292 conditions per place. [2025-03-14 01:45:16,751 INFO L140 encePairwiseOnDemand]: 504/515 looper letters, 39 selfloop transitions, 22 changer transitions 0/451 dead transitions. [2025-03-14 01:45:16,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 451 transitions, 1163 flow [2025-03-14 01:45:16,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2025-03-14 01:45:16,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915210355987055 [2025-03-14 01:45:16,756 INFO L175 Difference]: Start difference. First operand has 447 places, 422 transitions, 975 flow. Second operand 6 states and 2828 transitions. [2025-03-14 01:45:16,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 451 transitions, 1163 flow [2025-03-14 01:45:16,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 451 transitions, 1087 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-03-14 01:45:16,765 INFO L231 Difference]: Finished difference. Result has 434 places, 443 transitions, 1049 flow [2025-03-14 01:45:16,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=443} [2025-03-14 01:45:16,766 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2025-03-14 01:45:16,766 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 443 transitions, 1049 flow [2025-03-14 01:45:16,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:16,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:16,771 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] [2025-03-14 01:45:16,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:45:16,771 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:16,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:16,772 INFO L85 PathProgramCache]: Analyzing trace with hash 801998382, now seen corresponding path program 1 times [2025-03-14 01:45:16,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:16,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77255171] [2025-03-14 01:45:16,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:16,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:16,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-14 01:45:16,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-14 01:45:16,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:16,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:45:17,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:17,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77255171] [2025-03-14 01:45:17,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77255171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:17,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:17,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:17,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904634077] [2025-03-14 01:45:17,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:17,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:17,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:17,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:17,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-14 01:45:17,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 443 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:17,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:17,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-14 01:45:17,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:18,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L59-21-->L59-19: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][288], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 560#(= |#race~C~0| 0), 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 50#L59-19true, Black: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 74#L67-23true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-14 01:45:18,673 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-03-14 01:45:18,673 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-14 01:45:18,673 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-14 01:45:18,673 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-14 01:45:19,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, 155#L62true, Black: 526#true, Black: 558#true, 556#(= |#race~B~0| 0), 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 430#L67-7true]) [2025-03-14 01:45:19,208 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2025-03-14 01:45:19,208 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:45:19,208 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-03-14 01:45:19,208 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-03-14 01:45:19,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 90#L88true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 430#L67-7true]) [2025-03-14 01:45:19,235 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-03-14 01:45:19,235 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:45:19,235 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-14 01:45:19,235 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:45:19,350 INFO L124 PetriNetUnfolderBase]: 1328/14868 cut-off events. [2025-03-14 01:45:19,350 INFO L125 PetriNetUnfolderBase]: For 1655/1737 co-relation queries the response was YES. [2025-03-14 01:45:19,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18895 conditions, 14868 events. 1328/14868 cut-off events. For 1655/1737 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 172083 event pairs, 205 based on Foata normal form. 0/13463 useless extension candidates. Maximal degree in co-relation 18855. Up to 1392 conditions per place. [2025-03-14 01:45:19,450 INFO L140 encePairwiseOnDemand]: 504/515 looper letters, 55 selfloop transitions, 86 changer transitions 0/536 dead transitions. [2025-03-14 01:45:19,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 536 transitions, 1813 flow [2025-03-14 01:45:19,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2025-03-14 01:45:19,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915210355987055 [2025-03-14 01:45:19,454 INFO L175 Difference]: Start difference. First operand has 434 places, 443 transitions, 1049 flow. Second operand 6 states and 2828 transitions. [2025-03-14 01:45:19,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 536 transitions, 1813 flow [2025-03-14 01:45:19,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 536 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:45:19,465 INFO L231 Difference]: Finished difference. Result has 444 places, 528 transitions, 1903 flow [2025-03-14 01:45:19,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1903, PETRI_PLACES=444, PETRI_TRANSITIONS=528} [2025-03-14 01:45:19,466 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -11 predicate places. [2025-03-14 01:45:19,466 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 528 transitions, 1903 flow [2025-03-14 01:45:19,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:19,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:19,468 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] [2025-03-14 01:45:19,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:45:19,468 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:19,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1166223941, now seen corresponding path program 1 times [2025-03-14 01:45:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:19,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827489602] [2025-03-14 01:45:19,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:19,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:19,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-14 01:45:19,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-14 01:45:19,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:19,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:45:19,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:19,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827489602] [2025-03-14 01:45:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827489602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:19,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266468242] [2025-03-14 01:45:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:19,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:19,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:19,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:20,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-14 01:45:20,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 528 transitions, 1903 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:20,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:20,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-14 01:45:20,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:22,030 INFO L124 PetriNetUnfolderBase]: 1151/12311 cut-off events. [2025-03-14 01:45:22,030 INFO L125 PetriNetUnfolderBase]: For 3743/3853 co-relation queries the response was YES. [2025-03-14 01:45:22,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 12311 events. 1151/12311 cut-off events. For 3743/3853 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 136245 event pairs, 132 based on Foata normal form. 0/11311 useless extension candidates. Maximal degree in co-relation 17418. Up to 1063 conditions per place. [2025-03-14 01:45:22,175 INFO L140 encePairwiseOnDemand]: 509/515 looper letters, 106 selfloop transitions, 29 changer transitions 0/535 dead transitions. [2025-03-14 01:45:22,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 535 transitions, 2195 flow [2025-03-14 01:45:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2025-03-14 01:45:22,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080906148867314 [2025-03-14 01:45:22,183 INFO L175 Difference]: Start difference. First operand has 444 places, 528 transitions, 1903 flow. Second operand 6 states and 2806 transitions. [2025-03-14 01:45:22,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 535 transitions, 2195 flow [2025-03-14 01:45:22,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 535 transitions, 2195 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:45:22,194 INFO L231 Difference]: Finished difference. Result has 448 places, 527 transitions, 1959 flow [2025-03-14 01:45:22,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1959, PETRI_PLACES=448, PETRI_TRANSITIONS=527} [2025-03-14 01:45:22,195 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -7 predicate places. [2025-03-14 01:45:22,195 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 527 transitions, 1959 flow [2025-03-14 01:45:22,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:22,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:22,196 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] [2025-03-14 01:45:22,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:45:22,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1944176225, now seen corresponding path program 1 times [2025-03-14 01:45:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837871733] [2025-03-14 01:45:22,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:22,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:22,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-14 01:45:22,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-14 01:45:22,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:22,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:45:22,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:22,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837871733] [2025-03-14 01:45:22,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837871733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:22,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:22,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:22,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609063118] [2025-03-14 01:45:22,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:22,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:22,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:22,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:22,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-14 01:45:22,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 527 transitions, 1959 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:22,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:22,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-14 01:45:22,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:24,523 INFO L124 PetriNetUnfolderBase]: 1146/12228 cut-off events. [2025-03-14 01:45:24,523 INFO L125 PetriNetUnfolderBase]: For 4434/4544 co-relation queries the response was YES. [2025-03-14 01:45:24,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17858 conditions, 12228 events. 1146/12228 cut-off events. For 4434/4544 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 135258 event pairs, 132 based on Foata normal form. 0/11295 useless extension candidates. Maximal degree in co-relation 17812. Up to 1063 conditions per place. [2025-03-14 01:45:24,637 INFO L140 encePairwiseOnDemand]: 509/515 looper letters, 106 selfloop transitions, 29 changer transitions 0/534 dead transitions. [2025-03-14 01:45:24,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 534 transitions, 2251 flow [2025-03-14 01:45:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2025-03-14 01:45:24,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080906148867314 [2025-03-14 01:45:24,642 INFO L175 Difference]: Start difference. First operand has 448 places, 527 transitions, 1959 flow. Second operand 6 states and 2806 transitions. [2025-03-14 01:45:24,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 534 transitions, 2251 flow [2025-03-14 01:45:24,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 534 transitions, 2193 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:24,657 INFO L231 Difference]: Finished difference. Result has 447 places, 526 transitions, 1957 flow [2025-03-14 01:45:24,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1957, PETRI_PLACES=447, PETRI_TRANSITIONS=526} [2025-03-14 01:45:24,658 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2025-03-14 01:45:24,658 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 526 transitions, 1957 flow [2025-03-14 01:45:24,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:24,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:24,659 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] [2025-03-14 01:45:24,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:45:24,660 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:24,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash 833842206, now seen corresponding path program 1 times [2025-03-14 01:45:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906165475] [2025-03-14 01:45:24,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:24,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-14 01:45:24,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-14 01:45:24,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:24,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:45:24,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:24,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906165475] [2025-03-14 01:45:24,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906165475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:24,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:24,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:24,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863481111] [2025-03-14 01:45:24,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:24,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:24,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:24,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:24,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:24,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-14 01:45:24,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 526 transitions, 1957 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:24,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:24,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-14 01:45:24,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:27,150 INFO L124 PetriNetUnfolderBase]: 980/13163 cut-off events. [2025-03-14 01:45:27,151 INFO L125 PetriNetUnfolderBase]: For 2584/2700 co-relation queries the response was YES. [2025-03-14 01:45:27,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17772 conditions, 13163 events. 980/13163 cut-off events. For 2584/2700 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 146360 event pairs, 79 based on Foata normal form. 1/12214 useless extension candidates. Maximal degree in co-relation 17727. Up to 848 conditions per place. [2025-03-14 01:45:27,326 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 10 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2025-03-14 01:45:27,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 527 transitions, 1985 flow [2025-03-14 01:45:27,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2025-03-14 01:45:27,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423948220064725 [2025-03-14 01:45:27,330 INFO L175 Difference]: Start difference. First operand has 447 places, 526 transitions, 1957 flow. Second operand 3 states and 1456 transitions. [2025-03-14 01:45:27,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 527 transitions, 1985 flow [2025-03-14 01:45:27,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 527 transitions, 1927 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:27,344 INFO L231 Difference]: Finished difference. Result has 443 places, 525 transitions, 1901 flow [2025-03-14 01:45:27,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=443, PETRI_TRANSITIONS=525} [2025-03-14 01:45:27,346 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -12 predicate places. [2025-03-14 01:45:27,346 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 525 transitions, 1901 flow [2025-03-14 01:45:27,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:27,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:27,346 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] [2025-03-14 01:45:27,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:45:27,347 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:27,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1352829699, now seen corresponding path program 1 times [2025-03-14 01:45:27,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:27,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206383313] [2025-03-14 01:45:27,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:27,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:27,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-14 01:45:27,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-14 01:45:27,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:27,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:45:27,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:27,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206383313] [2025-03-14 01:45:27,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206383313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:27,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:27,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242739641] [2025-03-14 01:45:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:27,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:27,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:27,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:27,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-14 01:45:27,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 525 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:27,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:27,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-14 01:45:27,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:29,224 INFO L124 PetriNetUnfolderBase]: 1055/13325 cut-off events. [2025-03-14 01:45:29,224 INFO L125 PetriNetUnfolderBase]: For 2010/2135 co-relation queries the response was YES. [2025-03-14 01:45:29,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17599 conditions, 13325 events. 1055/13325 cut-off events. For 2010/2135 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 149986 event pairs, 101 based on Foata normal form. 1/12389 useless extension candidates. Maximal degree in co-relation 17554. Up to 858 conditions per place. [2025-03-14 01:45:29,366 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 10 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2025-03-14 01:45:29,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 526 transitions, 1929 flow [2025-03-14 01:45:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2025-03-14 01:45:29,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423948220064725 [2025-03-14 01:45:29,372 INFO L175 Difference]: Start difference. First operand has 443 places, 525 transitions, 1901 flow. Second operand 3 states and 1456 transitions. [2025-03-14 01:45:29,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 526 transitions, 1929 flow [2025-03-14 01:45:29,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 526 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:29,384 INFO L231 Difference]: Finished difference. Result has 442 places, 524 transitions, 1899 flow [2025-03-14 01:45:29,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=442, PETRI_TRANSITIONS=524} [2025-03-14 01:45:29,385 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -13 predicate places. [2025-03-14 01:45:29,385 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 524 transitions, 1899 flow [2025-03-14 01:45:29,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:29,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:29,386 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] [2025-03-14 01:45:29,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:45:29,386 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:29,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1995480872, now seen corresponding path program 1 times [2025-03-14 01:45:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:29,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625020625] [2025-03-14 01:45:29,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:29,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-14 01:45:29,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-14 01:45:29,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:29,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:45:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:29,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625020625] [2025-03-14 01:45:29,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625020625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:29,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:29,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:29,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122720375] [2025-03-14 01:45:29,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:29,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:29,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:29,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:29,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:29,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 515 [2025-03-14 01:45:29,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 524 transitions, 1899 flow. Second operand has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:29,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:29,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 515 [2025-03-14 01:45:29,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:34,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][535], [614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#true, Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 526#true, Black: 558#true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 603#true, 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 430#L67-7true, 93#L59-13true, 202#L51-13true]) [2025-03-14 01:45:34,646 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2025-03-14 01:45:34,646 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-14 01:45:34,646 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-14 01:45:34,646 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-14 01:45:34,745 INFO L124 PetriNetUnfolderBase]: 6087/33196 cut-off events. [2025-03-14 01:45:34,745 INFO L125 PetriNetUnfolderBase]: For 11989/12104 co-relation queries the response was YES. [2025-03-14 01:45:34,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55272 conditions, 33196 events. 6087/33196 cut-off events. For 11989/12104 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 407210 event pairs, 2256 based on Foata normal form. 0/31183 useless extension candidates. Maximal degree in co-relation 55226. Up to 8926 conditions per place. [2025-03-14 01:45:35,060 INFO L140 encePairwiseOnDemand]: 500/515 looper letters, 136 selfloop transitions, 77 changer transitions 0/584 dead transitions. [2025-03-14 01:45:35,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 584 transitions, 2629 flow [2025-03-14 01:45:35,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2749 transitions. [2025-03-14 01:45:35,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8896440129449839 [2025-03-14 01:45:35,063 INFO L175 Difference]: Start difference. First operand has 442 places, 524 transitions, 1899 flow. Second operand 6 states and 2749 transitions. [2025-03-14 01:45:35,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 584 transitions, 2629 flow [2025-03-14 01:45:35,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 584 transitions, 2625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:35,108 INFO L231 Difference]: Finished difference. Result has 450 places, 576 transitions, 2541 flow [2025-03-14 01:45:35,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2541, PETRI_PLACES=450, PETRI_TRANSITIONS=576} [2025-03-14 01:45:35,109 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-03-14 01:45:35,109 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 576 transitions, 2541 flow [2025-03-14 01:45:35,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:35,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:35,110 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] [2025-03-14 01:45:35,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:45:35,110 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:35,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1258043841, now seen corresponding path program 1 times [2025-03-14 01:45:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:35,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561097511] [2025-03-14 01:45:35,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:35,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-14 01:45:35,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-14 01:45:35,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:35,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:45:36,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:36,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561097511] [2025-03-14 01:45:36,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561097511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:36,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:36,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-14 01:45:36,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12922001] [2025-03-14 01:45:36,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:36,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 01:45:36,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:36,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 01:45:36,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:45:39,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 515 [2025-03-14 01:45:39,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 576 transitions, 2541 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:39,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:39,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 515 [2025-03-14 01:45:39,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:45,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1284] thread2EXIT-->L88: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 90#L88true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 253#L67-25true, Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-14 01:45:45,925 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-03-14 01:45:45,925 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-14 01:45:45,925 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-14 01:45:45,925 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-14 01:45:46,431 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1284] thread2EXIT-->L88: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 90#L88true, 603#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 253#L67-25true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-14 01:45:46,431 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2025-03-14 01:45:46,431 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-14 01:45:46,431 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-03-14 01:45:46,431 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-14 01:45:46,431 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-14 01:45:48,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 115#L54true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 93#L59-13true]) [2025-03-14 01:45:48,671 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2025-03-14 01:45:48,671 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-14 01:45:48,671 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-14 01:45:48,671 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-14 01:45:48,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1179] L67-25-->L67-23: Formula: (= |v_#race~B~0_6| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_6|} AuxVars[] AssignedVars[#race~B~0][287], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 50#L59-19true, 66#L50-2true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 556#(= |#race~B~0| 0), 74#L67-23true, 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0)]) [2025-03-14 01:45:48,763 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2025-03-14 01:45:48,763 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-03-14 01:45:48,763 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2025-03-14 01:45:48,763 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-03-14 01:45:48,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 93#L59-13true]) [2025-03-14 01:45:48,976 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2025-03-14 01:45:48,976 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-03-14 01:45:48,976 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-03-14 01:45:48,976 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-03-14 01:45:50,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1219] L67-6-->L67-5: Formula: (= (store |v_#race_36| v_~C~0.base_11 (store (select |v_#race_36| v_~C~0.base_11) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_43| 4) 2 v_~C~0.offset_11) |v_thread3Thread1of1ForFork0_#t~nondet12#1_7|)) |v_#race_35|) InVars {#race=|v_#race_36|, ~C~0.offset=v_~C~0.offset_11, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_43|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_11} OutVars{#race=|v_#race_35|, ~C~0.offset=v_~C~0.offset_11, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_43|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_11} AuxVars[] AssignedVars[#race][579], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 165#L58-2true, 202#L51-13true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), 311#L67-5true, Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2025-03-14 01:45:50,816 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2025-03-14 01:45:50,816 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-14 01:45:50,816 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-14 01:45:50,816 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-14 01:45:50,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L67-5-->L67-3: Formula: (= (store |v_#race_34| v_~C~0.base_10 (store (select |v_#race_34| v_~C~0.base_10) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_45| 4) 3 v_~C~0.offset_10) |v_thread3Thread1of1ForFork0_#t~nondet12#1_9|)) |v_#race_33|) InVars {#race=|v_#race_34|, ~C~0.offset=v_~C~0.offset_10, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_45|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_10} OutVars{#race=|v_#race_33|, ~C~0.offset=v_~C~0.offset_10, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_45|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_10} AuxVars[] AssignedVars[#race][597], [560#(= |#race~C~0| 0), 493#L67-3true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 165#L58-2true, 202#L51-13true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2025-03-14 01:45:50,845 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2025-03-14 01:45:50,845 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-14 01:45:50,845 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-14 01:45:50,845 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-14 01:45:50,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][405], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 115#L54true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 207#L59-14true]) [2025-03-14 01:45:50,858 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2025-03-14 01:45:50,858 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-14 01:45:50,859 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-14 01:45:50,859 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-14 01:45:50,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][405], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 207#L59-14true]) [2025-03-14 01:45:50,859 INFO L294 olderBase$Statistics]: this new event has 402 ancestors and is cut-off event [2025-03-14 01:45:50,860 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2025-03-14 01:45:50,860 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-03-14 01:45:50,860 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-03-14 01:45:50,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 218#L59-12true, Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-14 01:45:50,886 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2025-03-14 01:45:50,886 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-14 01:45:50,886 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-14 01:45:50,886 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2025-03-14 01:45:50,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 218#L59-12true, Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 115#L54true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0)]) [2025-03-14 01:45:50,886 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2025-03-14 01:45:50,886 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-14 01:45:50,886 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:45:50,886 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:45:51,061 INFO L124 PetriNetUnfolderBase]: 8434/64624 cut-off events. [2025-03-14 01:45:51,061 INFO L125 PetriNetUnfolderBase]: For 49205/54887 co-relation queries the response was YES. [2025-03-14 01:45:51,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109651 conditions, 64624 events. 8434/64624 cut-off events. For 49205/54887 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 930989 event pairs, 1041 based on Foata normal form. 501/61130 useless extension candidates. Maximal degree in co-relation 109598. Up to 4505 conditions per place. [2025-03-14 01:45:52,017 INFO L140 encePairwiseOnDemand]: 480/515 looper letters, 493 selfloop transitions, 44 changer transitions 0/939 dead transitions. [2025-03-14 01:45:52,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 939 transitions, 7205 flow [2025-03-14 01:45:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 01:45:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 01:45:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13770 transitions. [2025-03-14 01:45:52,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8355582524271845 [2025-03-14 01:45:52,024 INFO L175 Difference]: Start difference. First operand has 450 places, 576 transitions, 2541 flow. Second operand 32 states and 13770 transitions. [2025-03-14 01:45:52,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 939 transitions, 7205 flow [2025-03-14 01:45:52,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 939 transitions, 7169 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-14 01:45:52,248 INFO L231 Difference]: Finished difference. Result has 485 places, 593 transitions, 2700 flow [2025-03-14 01:45:52,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2700, PETRI_PLACES=485, PETRI_TRANSITIONS=593} [2025-03-14 01:45:52,251 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, 30 predicate places. [2025-03-14 01:45:52,251 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 593 transitions, 2700 flow [2025-03-14 01:45:52,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:52,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:52,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:45:52,255 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:45:52,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash 438196735, now seen corresponding path program 2 times [2025-03-14 01:45:52,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:52,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304273175] [2025-03-14 01:45:52,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:45:52,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:52,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 252 statements into 2 equivalence classes. [2025-03-14 01:45:52,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 207 of 252 statements. [2025-03-14 01:45:52,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:45:52,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:45:53,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304273175] [2025-03-14 01:45:53,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304273175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-14 01:45:53,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723798245] [2025-03-14 01:45:53,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 01:45:53,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 01:45:53,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:45:56,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 515 [2025-03-14 01:45:56,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 593 transitions, 2700 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:56,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:56,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 515 [2025-03-14 01:45:56,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:59,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L59-21-->L59-19: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][294], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 50#L59-19true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 799#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 115#L54true, 556#(= |#race~B~0| 0), 74#L67-23true, 282#L85-1true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-14 01:45:59,027 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is cut-off event [2025-03-14 01:45:59,027 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-14 01:45:59,027 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-14 01:45:59,027 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-14 01:45:59,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L59-21-->L59-19: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][294], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 50#L59-19true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 799#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 556#(= |#race~B~0| 0), 74#L67-23true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-14 01:45:59,655 INFO L294 olderBase$Statistics]: this new event has 314 ancestors and is cut-off event [2025-03-14 01:45:59,655 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-14 01:45:59,655 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-14 01:45:59,655 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-14 01:46:16,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][863], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 430#L67-7true, Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 797#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 282#L85-1true, 507#(= |#race~N~0| 0), 175#L51-16true, 528#(= |#race~A~0| 0), 93#L59-13true]) [2025-03-14 01:46:16,364 INFO L294 olderBase$Statistics]: this new event has 449 ancestors and is cut-off event [2025-03-14 01:46:16,364 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2025-03-14 01:46:16,364 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2025-03-14 01:46:16,364 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2025-03-14 01:46:16,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][870], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 430#L67-7true, Black: 727#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 797#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 396#L51-15true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 282#L85-1true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 93#L59-13true]) [2025-03-14 01:46:16,406 INFO L294 olderBase$Statistics]: this new event has 450 ancestors and is cut-off event [2025-03-14 01:46:16,406 INFO L297 olderBase$Statistics]: existing Event has 405 ancestors and is cut-off event [2025-03-14 01:46:16,406 INFO L297 olderBase$Statistics]: existing Event has 405 ancestors and is cut-off event [2025-03-14 01:46:16,406 INFO L297 olderBase$Statistics]: existing Event has 405 ancestors and is cut-off event [2025-03-14 01:46:16,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][866], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 430#L67-7true, Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 797#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 424#L51-14true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 282#L85-1true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 93#L59-13true]) [2025-03-14 01:46:16,448 INFO L294 olderBase$Statistics]: this new event has 451 ancestors and is cut-off event [2025-03-14 01:46:16,448 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2025-03-14 01:46:16,448 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2025-03-14 01:46:16,448 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2025-03-14 01:46:16,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][860], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 102#L51-12true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 430#L67-7true, Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 797#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 282#L85-1true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 93#L59-13true]) [2025-03-14 01:46:16,492 INFO L294 olderBase$Statistics]: this new event has 452 ancestors and is cut-off event [2025-03-14 01:46:16,492 INFO L297 olderBase$Statistics]: existing Event has 407 ancestors and is cut-off event [2025-03-14 01:46:16,492 INFO L297 olderBase$Statistics]: existing Event has 407 ancestors and is cut-off event [2025-03-14 01:46:16,492 INFO L297 olderBase$Statistics]: existing Event has 407 ancestors and is cut-off event [2025-03-14 01:46:17,722 INFO L124 PetriNetUnfolderBase]: 15734/113380 cut-off events. [2025-03-14 01:46:17,722 INFO L125 PetriNetUnfolderBase]: For 96717/106731 co-relation queries the response was YES. [2025-03-14 01:46:19,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202900 conditions, 113380 events. 15734/113380 cut-off events. For 96717/106731 co-relation queries the response was YES. Maximal size of possible extension queue 1088. Compared 1724472 event pairs, 1749 based on Foata normal form. 475/106920 useless extension candidates. Maximal degree in co-relation 202842. Up to 8949 conditions per place. [2025-03-14 01:46:19,514 INFO L140 encePairwiseOnDemand]: 480/515 looper letters, 619 selfloop transitions, 49 changer transitions 0/1070 dead transitions. [2025-03-14 01:46:19,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 1070 transitions, 8928 flow [2025-03-14 01:46:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 01:46:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 01:46:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13774 transitions. [2025-03-14 01:46:19,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8358009708737864 [2025-03-14 01:46:19,520 INFO L175 Difference]: Start difference. First operand has 485 places, 593 transitions, 2700 flow. Second operand 32 states and 13774 transitions. [2025-03-14 01:46:19,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 1070 transitions, 8928 flow [2025-03-14 01:46:20,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 1070 transitions, 8877 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-03-14 01:46:20,027 INFO L231 Difference]: Finished difference. Result has 494 places, 612 transitions, 2920 flow [2025-03-14 01:46:20,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=2649, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2920, PETRI_PLACES=494, PETRI_TRANSITIONS=612} [2025-03-14 01:46:20,028 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, 39 predicate places. [2025-03-14 01:46:20,028 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 612 transitions, 2920 flow [2025-03-14 01:46:20,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:20,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:20,030 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] [2025-03-14 01:46:20,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:46:20,030 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-14 01:46:20,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:20,031 INFO L85 PathProgramCache]: Analyzing trace with hash 116974145, now seen corresponding path program 1 times [2025-03-14 01:46:20,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:20,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815733402] [2025-03-14 01:46:20,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:20,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:20,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-14 01:46:20,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-14 01:46:20,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:20,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat