./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/25_stack-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/pthread-ext/25_stack-race.i -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 4272d82e4e32dc4af1661c2cd99f5af7e9487f266698e80f4586c30581d39fa9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:07:13,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:07:13,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:07:13,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:07:13,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:07:13,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:07:13,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:07:13,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:07:13,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:07:13,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:07:13,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:07:13,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:07:13,932 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:07:13,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:07:13,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:07:13,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:07:13,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:07:13,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:07:13,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:07:13,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:07:13,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:07:13,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:07:13,937 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:07:13,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:07:13,938 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:07:13,938 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:07:13,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:07:13,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:07:13,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:07:13,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:07:13,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:07:13,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:07:13,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:07:13,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:07:13,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:07:13,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:07:13,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:07:13,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:07:13,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:07:13,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:07:13,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:07:13,940 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 4272d82e4e32dc4af1661c2cd99f5af7e9487f266698e80f4586c30581d39fa9 [2024-11-10 14:07:14,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:07:14,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:07:14,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:07:14,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:07:14,160 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:07:14,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/25_stack-race.i [2024-11-10 14:07:15,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:07:15,485 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:07:15,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack-race.i [2024-11-10 14:07:15,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c73f7d8/a3d5197dd642474fa6b4499633c5f864/FLAGf330005e1 [2024-11-10 14:07:15,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c73f7d8/a3d5197dd642474fa6b4499633c5f864 [2024-11-10 14:07:15,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:07:15,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:07:15,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:07:15,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:07:15,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:07:15,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:07:15" (1/1) ... [2024-11-10 14:07:15,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3567df70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:15, skipping insertion in model container [2024-11-10 14:07:15,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:07:15" (1/1) ... [2024-11-10 14:07:15,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:07:15,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:07:15,933 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:07:15,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:07:16,017 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:07:16,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16 WrapperNode [2024-11-10 14:07:16,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:07:16,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:07:16,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:07:16,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:07:16,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (1/1) ... [2024-11-10 14:07:16,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (1/1) ... [2024-11-10 14:07:16,076 INFO L138 Inliner]: procedures = 176, calls = 32, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 356 [2024-11-10 14:07:16,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:07:16,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:07:16,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:07:16,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:07:16,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (1/1) ... [2024-11-10 14:07:16,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (1/1) ... [2024-11-10 14:07:16,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (1/1) ... [2024-11-10 14:07:16,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (1/1) ... [2024-11-10 14:07:16,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (1/1) ... [2024-11-10 14:07:16,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (1/1) ... [2024-11-10 14:07:16,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (1/1) ... [2024-11-10 14:07:16,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (1/1) ... [2024-11-10 14:07:16,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:07:16,113 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:07:16,113 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:07:16,114 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:07:16,114 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (1/1) ... [2024-11-10 14:07:16,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:07:16,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:07:16,159 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) [2024-11-10 14:07:16,169 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 [2024-11-10 14:07:16,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:07:16,203 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-10 14:07:16,203 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-10 14:07:16,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:07:16,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:07:16,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:07:16,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:07:16,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:07:16,205 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:07:16,324 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:07:16,326 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:07:16,767 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:07:16,770 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:07:17,051 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:07:17,052 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:07:17,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:07:17 BoogieIcfgContainer [2024-11-10 14:07:17,053 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:07:17,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:07:17,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:07:17,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:07:17,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:07:15" (1/3) ... [2024-11-10 14:07:17,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b53de7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:07:17, skipping insertion in model container [2024-11-10 14:07:17,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:16" (2/3) ... [2024-11-10 14:07:17,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b53de7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:07:17, skipping insertion in model container [2024-11-10 14:07:17,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:07:17" (3/3) ... [2024-11-10 14:07:17,062 INFO L112 eAbstractionObserver]: Analyzing ICFG 25_stack-race.i [2024-11-10 14:07:17,077 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:07:17,077 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-11-10 14:07:17,077 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:07:17,163 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:07:17,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 226 transitions, 456 flow [2024-11-10 14:07:17,281 INFO L124 PetriNetUnfolderBase]: 8/236 cut-off events. [2024-11-10 14:07:17,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:07:17,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 236 events. 8/236 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 257 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 141. Up to 4 conditions per place. [2024-11-10 14:07:17,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 226 transitions, 456 flow [2024-11-10 14:07:17,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 226 transitions, 456 flow [2024-11-10 14:07:17,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:07:17,307 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;@6eda03d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:07:17,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2024-11-10 14:07:17,322 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:07:17,324 INFO L124 PetriNetUnfolderBase]: 1/97 cut-off events. [2024-11-10 14:07:17,324 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:07:17,325 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:17,325 INFO L204 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] [2024-11-10 14:07:17,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2024-11-10 14:07:17,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1931125895, now seen corresponding path program 1 times [2024-11-10 14:07:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:17,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260133277] [2024-11-10 14:07:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:07:18,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:18,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260133277] [2024-11-10 14:07:18,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260133277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:18,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:18,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 14:07:18,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888993593] [2024-11-10 14:07:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:18,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:07:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:18,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:07:18,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:07:18,058 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 226 [2024-11-10 14:07:18,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 226 transitions, 456 flow. Second operand has 2 states, 2 states have (on average 199.0) internal successors, (398), 2 states have internal predecessors, (398), 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) [2024-11-10 14:07:18,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:18,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 226 [2024-11-10 14:07:18,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:18,139 INFO L124 PetriNetUnfolderBase]: 4/208 cut-off events. [2024-11-10 14:07:18,139 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:07:18,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 208 events. 4/208 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 154 event pairs, 0 based on Foata normal form. 16/209 useless extension candidates. Maximal degree in co-relation 126. Up to 10 conditions per place. [2024-11-10 14:07:18,141 INFO L140 encePairwiseOnDemand]: 207/226 looper letters, 9 selfloop transitions, 0 changer transitions 0/203 dead transitions. [2024-11-10 14:07:18,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 203 transitions, 428 flow [2024-11-10 14:07:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:07:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:07:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 424 transitions. [2024-11-10 14:07:18,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2024-11-10 14:07:18,155 INFO L175 Difference]: Start difference. First operand has 222 places, 226 transitions, 456 flow. Second operand 2 states and 424 transitions. [2024-11-10 14:07:18,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 203 transitions, 428 flow [2024-11-10 14:07:18,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 203 transitions, 428 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:07:18,161 INFO L231 Difference]: Finished difference. Result has 203 places, 203 transitions, 410 flow [2024-11-10 14:07:18,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=410, PETRI_PLACES=203, PETRI_TRANSITIONS=203} [2024-11-10 14:07:18,167 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, -19 predicate places. [2024-11-10 14:07:18,167 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 203 transitions, 410 flow [2024-11-10 14:07:18,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 199.0) internal successors, (398), 2 states have internal predecessors, (398), 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) [2024-11-10 14:07:18,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:18,168 INFO L204 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] [2024-11-10 14:07:18,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:07:18,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2024-11-10 14:07:18,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash 386145067, now seen corresponding path program 1 times [2024-11-10 14:07:18,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:18,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742813335] [2024-11-10 14:07:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:18,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:07:18,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:18,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742813335] [2024-11-10 14:07:18,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742813335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:18,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:18,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:18,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712401958] [2024-11-10 14:07:18,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:18,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:18,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:18,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:18,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 226 [2024-11-10 14:07:18,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 203 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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) [2024-11-10 14:07:18,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:18,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 226 [2024-11-10 14:07:18,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:18,320 INFO L124 PetriNetUnfolderBase]: 6/297 cut-off events. [2024-11-10 14:07:18,320 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:07:18,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 297 events. 6/297 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 459 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 318. Up to 11 conditions per place. [2024-11-10 14:07:18,322 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 17 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2024-11-10 14:07:18,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 209 transitions, 460 flow [2024-11-10 14:07:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2024-11-10 14:07:18,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.887905604719764 [2024-11-10 14:07:18,327 INFO L175 Difference]: Start difference. First operand has 203 places, 203 transitions, 410 flow. Second operand 3 states and 602 transitions. [2024-11-10 14:07:18,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 209 transitions, 460 flow [2024-11-10 14:07:18,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 209 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:07:18,331 INFO L231 Difference]: Finished difference. Result has 204 places, 202 transitions, 412 flow [2024-11-10 14:07:18,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=204, PETRI_TRANSITIONS=202} [2024-11-10 14:07:18,333 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, -18 predicate places. [2024-11-10 14:07:18,333 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 202 transitions, 412 flow [2024-11-10 14:07:18,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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) [2024-11-10 14:07:18,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:18,334 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:07:18,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:07:18,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2024-11-10 14:07:18,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:18,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1458324033, now seen corresponding path program 1 times [2024-11-10 14:07:18,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:18,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883113829] [2024-11-10 14:07:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:07:18,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:07:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:07:18,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:07:18,408 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:07:18,409 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2024-11-10 14:07:18,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2024-11-10 14:07:18,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2024-11-10 14:07:18,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2024-11-10 14:07:18,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2024-11-10 14:07:18,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2024-11-10 14:07:18,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2024-11-10 14:07:18,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2024-11-10 14:07:18,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2024-11-10 14:07:18,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2024-11-10 14:07:18,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2024-11-10 14:07:18,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2024-11-10 14:07:18,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2024-11-10 14:07:18,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2024-11-10 14:07:18,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2024-11-10 14:07:18,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2024-11-10 14:07:18,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2024-11-10 14:07:18,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2024-11-10 14:07:18,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2024-11-10 14:07:18,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2024-11-10 14:07:18,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2024-11-10 14:07:18,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2024-11-10 14:07:18,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2024-11-10 14:07:18,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2024-11-10 14:07:18,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2024-11-10 14:07:18,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2024-11-10 14:07:18,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2024-11-10 14:07:18,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2024-11-10 14:07:18,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2024-11-10 14:07:18,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2024-11-10 14:07:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2024-11-10 14:07:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2024-11-10 14:07:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2024-11-10 14:07:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2024-11-10 14:07:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2024-11-10 14:07:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2024-11-10 14:07:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2024-11-10 14:07:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2024-11-10 14:07:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2024-11-10 14:07:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2024-11-10 14:07:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2024-11-10 14:07:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2024-11-10 14:07:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2024-11-10 14:07:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2024-11-10 14:07:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2024-11-10 14:07:18,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2024-11-10 14:07:18,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2024-11-10 14:07:18,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2024-11-10 14:07:18,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2024-11-10 14:07:18,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2024-11-10 14:07:18,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2024-11-10 14:07:18,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2024-11-10 14:07:18,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2024-11-10 14:07:18,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:07:18,418 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 14:07:18,420 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:07:18,420 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:07:18,501 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:07:18,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 348 places, 356 transitions, 722 flow [2024-11-10 14:07:18,560 INFO L124 PetriNetUnfolderBase]: 15/378 cut-off events. [2024-11-10 14:07:18,560 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:07:18,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 378 events. 15/378 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 895 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 270. Up to 6 conditions per place. [2024-11-10 14:07:18,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 348 places, 356 transitions, 722 flow [2024-11-10 14:07:18,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 348 places, 356 transitions, 722 flow [2024-11-10 14:07:18,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:07:18,572 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;@6eda03d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:07:18,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-11-10 14:07:18,578 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:07:18,578 INFO L124 PetriNetUnfolderBase]: 1/97 cut-off events. [2024-11-10 14:07:18,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:07:18,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:18,578 INFO L204 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] [2024-11-10 14:07:18,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-10 14:07:18,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash -242165812, now seen corresponding path program 1 times [2024-11-10 14:07:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700388559] [2024-11-10 14:07:18,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:07:18,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:18,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700388559] [2024-11-10 14:07:18,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700388559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:18,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:18,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 14:07:18,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845663043] [2024-11-10 14:07:18,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:18,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:07:18,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:18,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:07:18,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:07:18,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 356 [2024-11-10 14:07:18,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 356 transitions, 722 flow. Second operand has 2 states, 2 states have (on average 303.0) internal successors, (606), 2 states have internal predecessors, (606), 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) [2024-11-10 14:07:18,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:18,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 356 [2024-11-10 14:07:18,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:19,014 INFO L124 PetriNetUnfolderBase]: 112/1363 cut-off events. [2024-11-10 14:07:19,014 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-10 14:07:19,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 1363 events. 112/1363 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8246 event pairs, 52 based on Foata normal form. 179/1369 useless extension candidates. Maximal degree in co-relation 1293. Up to 161 conditions per place. [2024-11-10 14:07:19,024 INFO L140 encePairwiseOnDemand]: 320/356 looper letters, 18 selfloop transitions, 0 changer transitions 0/315 dead transitions. [2024-11-10 14:07:19,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 315 transitions, 676 flow [2024-11-10 14:07:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:07:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:07:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 658 transitions. [2024-11-10 14:07:19,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9241573033707865 [2024-11-10 14:07:19,027 INFO L175 Difference]: Start difference. First operand has 348 places, 356 transitions, 722 flow. Second operand 2 states and 658 transitions. [2024-11-10 14:07:19,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 315 transitions, 676 flow [2024-11-10 14:07:19,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 315 transitions, 676 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:07:19,031 INFO L231 Difference]: Finished difference. Result has 313 places, 315 transitions, 640 flow [2024-11-10 14:07:19,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=640, PETRI_PLACES=313, PETRI_TRANSITIONS=315} [2024-11-10 14:07:19,032 INFO L277 CegarLoopForPetriNet]: 348 programPoint places, -35 predicate places. [2024-11-10 14:07:19,032 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 315 transitions, 640 flow [2024-11-10 14:07:19,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 303.0) internal successors, (606), 2 states have internal predecessors, (606), 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) [2024-11-10 14:07:19,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:19,033 INFO L204 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] [2024-11-10 14:07:19,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:07:19,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-10 14:07:19,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash -793063984, now seen corresponding path program 1 times [2024-11-10 14:07:19,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:19,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471791258] [2024-11-10 14:07:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:07:19,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:19,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471791258] [2024-11-10 14:07:19,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471791258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:19,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:19,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:19,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073761576] [2024-11-10 14:07:19,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:19,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:19,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:19,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:19,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:19,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 356 [2024-11-10 14:07:19,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 315 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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) [2024-11-10 14:07:19,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:19,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 356 [2024-11-10 14:07:19,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:19,600 INFO L124 PetriNetUnfolderBase]: 366/3767 cut-off events. [2024-11-10 14:07:19,601 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-10 14:07:19,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 3767 events. 366/3767 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 33364 event pairs, 95 based on Foata normal form. 0/3285 useless extension candidates. Maximal degree in co-relation 4386. Up to 290 conditions per place. [2024-11-10 14:07:19,624 INFO L140 encePairwiseOnDemand]: 348/356 looper letters, 43 selfloop transitions, 6 changer transitions 0/338 dead transitions. [2024-11-10 14:07:19,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 338 transitions, 789 flow [2024-11-10 14:07:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2024-11-10 14:07:19,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8735955056179775 [2024-11-10 14:07:19,626 INFO L175 Difference]: Start difference. First operand has 313 places, 315 transitions, 640 flow. Second operand 3 states and 933 transitions. [2024-11-10 14:07:19,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 338 transitions, 789 flow [2024-11-10 14:07:19,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 338 transitions, 789 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:07:19,631 INFO L231 Difference]: Finished difference. Result has 317 places, 321 transitions, 692 flow [2024-11-10 14:07:19,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=317, PETRI_TRANSITIONS=321} [2024-11-10 14:07:19,632 INFO L277 CegarLoopForPetriNet]: 348 programPoint places, -31 predicate places. [2024-11-10 14:07:19,632 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 321 transitions, 692 flow [2024-11-10 14:07:19,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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) [2024-11-10 14:07:19,633 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:19,633 INFO L204 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] [2024-11-10 14:07:19,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:07:19,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-10 14:07:19,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:19,633 INFO L85 PathProgramCache]: Analyzing trace with hash -186782743, now seen corresponding path program 1 times [2024-11-10 14:07:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:19,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273587485] [2024-11-10 14:07:19,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:19,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:07:19,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273587485] [2024-11-10 14:07:19,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273587485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:19,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:19,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:19,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462309393] [2024-11-10 14:07:19,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:19,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:19,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:19,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:19,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 356 [2024-11-10 14:07:19,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 321 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 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) [2024-11-10 14:07:19,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:19,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 356 [2024-11-10 14:07:19,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:20,262 INFO L124 PetriNetUnfolderBase]: 674/4947 cut-off events. [2024-11-10 14:07:20,262 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-11-10 14:07:20,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6203 conditions, 4947 events. 674/4947 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 46161 event pairs, 283 based on Foata normal form. 0/4281 useless extension candidates. Maximal degree in co-relation 6196. Up to 992 conditions per place. [2024-11-10 14:07:20,297 INFO L140 encePairwiseOnDemand]: 348/356 looper letters, 37 selfloop transitions, 7 changer transitions 0/335 dead transitions. [2024-11-10 14:07:20,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 335 transitions, 813 flow [2024-11-10 14:07:20,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2024-11-10 14:07:20,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8567415730337079 [2024-11-10 14:07:20,300 INFO L175 Difference]: Start difference. First operand has 317 places, 321 transitions, 692 flow. Second operand 3 states and 915 transitions. [2024-11-10 14:07:20,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 335 transitions, 813 flow [2024-11-10 14:07:20,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 335 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:07:20,305 INFO L231 Difference]: Finished difference. Result has 319 places, 327 transitions, 734 flow [2024-11-10 14:07:20,306 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=319, PETRI_TRANSITIONS=327} [2024-11-10 14:07:20,308 INFO L277 CegarLoopForPetriNet]: 348 programPoint places, -29 predicate places. [2024-11-10 14:07:20,308 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 327 transitions, 734 flow [2024-11-10 14:07:20,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 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) [2024-11-10 14:07:20,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:20,309 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:07:20,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:07:20,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-10 14:07:20,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:20,310 INFO L85 PathProgramCache]: Analyzing trace with hash -936027195, now seen corresponding path program 1 times [2024-11-10 14:07:20,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:20,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248533796] [2024-11-10 14:07:20,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:20,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:07:20,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:07:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:07:20,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:07:20,355 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:07:20,355 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2024-11-10 14:07:20,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2024-11-10 14:07:20,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2024-11-10 14:07:20,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2024-11-10 14:07:20,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2024-11-10 14:07:20,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2024-11-10 14:07:20,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2024-11-10 14:07:20,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2024-11-10 14:07:20,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2024-11-10 14:07:20,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2024-11-10 14:07:20,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2024-11-10 14:07:20,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2024-11-10 14:07:20,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2024-11-10 14:07:20,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2024-11-10 14:07:20,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2024-11-10 14:07:20,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2024-11-10 14:07:20,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2024-11-10 14:07:20,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2024-11-10 14:07:20,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2024-11-10 14:07:20,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2024-11-10 14:07:20,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2024-11-10 14:07:20,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2024-11-10 14:07:20,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2024-11-10 14:07:20,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2024-11-10 14:07:20,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2024-11-10 14:07:20,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2024-11-10 14:07:20,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2024-11-10 14:07:20,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2024-11-10 14:07:20,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2024-11-10 14:07:20,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2024-11-10 14:07:20,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2024-11-10 14:07:20,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2024-11-10 14:07:20,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2024-11-10 14:07:20,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2024-11-10 14:07:20,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2024-11-10 14:07:20,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2024-11-10 14:07:20,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2024-11-10 14:07:20,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2024-11-10 14:07:20,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2024-11-10 14:07:20,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2024-11-10 14:07:20,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2024-11-10 14:07:20,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2024-11-10 14:07:20,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2024-11-10 14:07:20,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2024-11-10 14:07:20,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2024-11-10 14:07:20,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2024-11-10 14:07:20,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2024-11-10 14:07:20,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2024-11-10 14:07:20,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2024-11-10 14:07:20,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2024-11-10 14:07:20,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2024-11-10 14:07:20,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2024-11-10 14:07:20,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2024-11-10 14:07:20,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2024-11-10 14:07:20,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2024-11-10 14:07:20,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2024-11-10 14:07:20,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2024-11-10 14:07:20,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2024-11-10 14:07:20,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2024-11-10 14:07:20,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2024-11-10 14:07:20,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2024-11-10 14:07:20,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2024-11-10 14:07:20,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2024-11-10 14:07:20,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2024-11-10 14:07:20,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2024-11-10 14:07:20,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2024-11-10 14:07:20,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2024-11-10 14:07:20,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2024-11-10 14:07:20,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:07:20,372 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 14:07:20,373 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:07:20,373 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:07:20,508 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:07:20,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 474 places, 486 transitions, 990 flow [2024-11-10 14:07:20,605 INFO L124 PetriNetUnfolderBase]: 22/520 cut-off events. [2024-11-10 14:07:20,605 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:07:20,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 520 events. 22/520 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1696 event pairs, 0 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 399. Up to 8 conditions per place. [2024-11-10 14:07:20,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 474 places, 486 transitions, 990 flow [2024-11-10 14:07:20,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 474 places, 486 transitions, 990 flow [2024-11-10 14:07:20,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:07:20,621 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;@6eda03d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:07:20,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2024-11-10 14:07:20,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:07:20,628 INFO L124 PetriNetUnfolderBase]: 1/97 cut-off events. [2024-11-10 14:07:20,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:07:20,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:20,629 INFO L204 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] [2024-11-10 14:07:20,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2024-11-10 14:07:20,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash 386099251, now seen corresponding path program 1 times [2024-11-10 14:07:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:20,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380061996] [2024-11-10 14:07:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:20,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:07:20,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:20,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380061996] [2024-11-10 14:07:20,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380061996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:20,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:20,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 14:07:20,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956675631] [2024-11-10 14:07:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:20,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:07:20,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:20,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:07:20,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:07:20,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 486 [2024-11-10 14:07:20,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 486 transitions, 990 flow. Second operand has 2 states, 2 states have (on average 407.0) internal successors, (814), 2 states have internal predecessors, (814), 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) [2024-11-10 14:07:20,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:20,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 486 [2024-11-10 14:07:20,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:22,603 INFO L124 PetriNetUnfolderBase]: 1746/12410 cut-off events. [2024-11-10 14:07:22,604 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2024-11-10 14:07:22,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14863 conditions, 12410 events. 1746/12410 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 140013 event pairs, 990 based on Foata normal form. 1881/12650 useless extension candidates. Maximal degree in co-relation 12948. Up to 2182 conditions per place. [2024-11-10 14:07:22,734 INFO L140 encePairwiseOnDemand]: 433/486 looper letters, 27 selfloop transitions, 0 changer transitions 0/427 dead transitions. [2024-11-10 14:07:22,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 427 transitions, 926 flow [2024-11-10 14:07:22,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:07:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:07:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 892 transitions. [2024-11-10 14:07:22,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9176954732510288 [2024-11-10 14:07:22,737 INFO L175 Difference]: Start difference. First operand has 474 places, 486 transitions, 990 flow. Second operand 2 states and 892 transitions. [2024-11-10 14:07:22,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 427 transitions, 926 flow [2024-11-10 14:07:22,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 427 transitions, 924 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-10 14:07:22,744 INFO L231 Difference]: Finished difference. Result has 423 places, 427 transitions, 870 flow [2024-11-10 14:07:22,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=870, PETRI_PLACES=423, PETRI_TRANSITIONS=427} [2024-11-10 14:07:22,745 INFO L277 CegarLoopForPetriNet]: 474 programPoint places, -51 predicate places. [2024-11-10 14:07:22,745 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 427 transitions, 870 flow [2024-11-10 14:07:22,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 407.0) internal successors, (814), 2 states have internal predecessors, (814), 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) [2024-11-10 14:07:22,746 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:22,746 INFO L204 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] [2024-11-10 14:07:22,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:07:22,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2024-11-10 14:07:22,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:22,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1674255671, now seen corresponding path program 1 times [2024-11-10 14:07:22,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:22,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643600456] [2024-11-10 14:07:22,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:22,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:07:22,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:22,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643600456] [2024-11-10 14:07:22,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643600456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:22,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:22,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205634663] [2024-11-10 14:07:22,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:22,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:22,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:22,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:22,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:22,828 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 486 [2024-11-10 14:07:22,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 427 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 395.3333333333333) internal successors, (1186), 3 states have internal predecessors, (1186), 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) [2024-11-10 14:07:22,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:22,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 486 [2024-11-10 14:07:22,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:29,783 INFO L124 PetriNetUnfolderBase]: 9398/56517 cut-off events. [2024-11-10 14:07:29,783 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2024-11-10 14:07:30,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69736 conditions, 56517 events. 9398/56517 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 835355 event pairs, 2713 based on Foata normal form. 0/49040 useless extension candidates. Maximal degree in co-relation 69730. Up to 6330 conditions per place. [2024-11-10 14:07:30,546 INFO L140 encePairwiseOnDemand]: 474/486 looper letters, 65 selfloop transitions, 9 changer transitions 0/462 dead transitions. [2024-11-10 14:07:30,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 462 transitions, 1098 flow [2024-11-10 14:07:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-11-10 14:07:30,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8635116598079561 [2024-11-10 14:07:30,550 INFO L175 Difference]: Start difference. First operand has 423 places, 427 transitions, 870 flow. Second operand 3 states and 1259 transitions. [2024-11-10 14:07:30,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 462 transitions, 1098 flow [2024-11-10 14:07:30,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 462 transitions, 1098 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:07:30,556 INFO L231 Difference]: Finished difference. Result has 427 places, 436 transitions, 948 flow [2024-11-10 14:07:30,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=427, PETRI_TRANSITIONS=436} [2024-11-10 14:07:30,558 INFO L277 CegarLoopForPetriNet]: 474 programPoint places, -47 predicate places. [2024-11-10 14:07:30,558 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 436 transitions, 948 flow [2024-11-10 14:07:30,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.3333333333333) internal successors, (1186), 3 states have internal predecessors, (1186), 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) [2024-11-10 14:07:30,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:30,559 INFO L204 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] [2024-11-10 14:07:30,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:07:30,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2024-11-10 14:07:30,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash -565416376, now seen corresponding path program 1 times [2024-11-10 14:07:30,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:30,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446501419] [2024-11-10 14:07:30,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:30,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:07:30,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:30,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446501419] [2024-11-10 14:07:30,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446501419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:30,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:30,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:30,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473148727] [2024-11-10 14:07:30,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:30,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:30,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:30,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:30,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:30,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 486 [2024-11-10 14:07:30,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 436 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 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) [2024-11-10 14:07:30,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:30,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 486 [2024-11-10 14:07:30,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:31,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [424#L767true, 477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 447#EBStack_init_returnLabel#1true, 479#true, 471#true, 21#L775-2true, 484#true, 473#true]) [2024-11-10 14:07:31,932 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-11-10 14:07:31,932 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-10 14:07:31,932 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-10 14:07:31,932 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-10 14:07:31,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [424#L767true, 477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 479#true, 471#true, 21#L775-2true, 484#true, 238#L763true, 473#true]) [2024-11-10 14:07:31,991 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-11-10 14:07:31,992 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-10 14:07:31,992 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-10 14:07:31,992 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-10 14:07:34,107 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 447#EBStack_init_returnLabel#1true, 479#true, 471#true, 21#L775-2true, 7#L706-2true, 484#true, 473#true]) [2024-11-10 14:07:34,107 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-10 14:07:34,107 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-10 14:07:34,107 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-11-10 14:07:34,107 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-10 14:07:34,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 479#true, 471#true, 21#L775-2true, 7#L706-2true, 484#true, 238#L763true, 473#true]) [2024-11-10 14:07:34,271 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2024-11-10 14:07:34,271 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-10 14:07:34,271 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-10 14:07:34,271 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-10 14:07:34,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 447#EBStack_init_returnLabel#1true, 479#true, 471#true, 21#L775-2true, 484#true, 109#L708true, 473#true]) [2024-11-10 14:07:34,829 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-10 14:07:34,830 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-10 14:07:34,830 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-10 14:07:34,830 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-10 14:07:35,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 479#true, 471#true, 21#L775-2true, 484#true, 109#L708true, 238#L763true, 473#true]) [2024-11-10 14:07:35,017 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-11-10 14:07:35,017 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-10 14:07:35,017 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2024-11-10 14:07:35,017 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2024-11-10 14:07:37,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 447#EBStack_init_returnLabel#1true, 479#true, 471#true, 21#L775-2true, 484#true, 473#true, 305#L733-2true]) [2024-11-10 14:07:37,616 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2024-11-10 14:07:37,616 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-11-10 14:07:37,616 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-11-10 14:07:37,616 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-11-10 14:07:38,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 479#true, 471#true, 21#L775-2true, 484#true, 238#L763true, 473#true, 305#L733-2true]) [2024-11-10 14:07:38,141 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2024-11-10 14:07:38,141 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-10 14:07:38,142 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:07:38,142 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-10 14:07:38,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 193#L733-1true, 447#EBStack_init_returnLabel#1true, 479#true, 471#true, 21#L775-2true, 484#true, 473#true]) [2024-11-10 14:07:38,143 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2024-11-10 14:07:38,143 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:07:38,143 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-10 14:07:38,143 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-10 14:07:38,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 193#L733-1true, 479#true, 471#true, 21#L775-2true, 484#true, 238#L763true, 473#true]) [2024-11-10 14:07:38,238 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2024-11-10 14:07:38,238 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-10 14:07:38,238 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2024-11-10 14:07:38,238 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-10 14:07:39,413 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 427#L735-1true, 33#L767true, 475#true, 447#EBStack_init_returnLabel#1true, 479#true, 471#true, 21#L775-2true, 484#true, 473#true]) [2024-11-10 14:07:39,413 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2024-11-10 14:07:39,413 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-11-10 14:07:39,413 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-11-10 14:07:39,413 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-11-10 14:07:39,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 427#L735-1true, 33#L767true, 475#true, 479#true, 471#true, 21#L775-2true, 484#true, 238#L763true, 473#true]) [2024-11-10 14:07:39,509 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2024-11-10 14:07:39,509 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:07:39,509 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:07:39,509 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-11-10 14:07:39,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 447#EBStack_init_returnLabel#1true, 479#true, 471#true, 21#L775-2true, 484#true, 252#L737-1true, 473#true]) [2024-11-10 14:07:39,710 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2024-11-10 14:07:39,710 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-11-10 14:07:39,710 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2024-11-10 14:07:39,710 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2024-11-10 14:07:39,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] L766-3-->L767: Formula: (let ((.cse0 (select |v_#race_755| |v_~#m2~0.base_21|)) (.cse4 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse1 (+ |v_~#m2~0.offset_21| 2)) (.cse2 (select .cse0 .cse4)) (.cse5 (select |v_#memory_int_235| |v_~#m2~0.base_21|))) (and (= (select .cse0 .cse1) .cse2) (= .cse2 (select .cse0 |v_~#m2~0.offset_21|)) (= .cse2 (select .cse0 .cse3)) (= (store |v_#race_757| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_757| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse3 .cse2) .cse1 .cse2) .cse4 .cse2)) |v_#race_755|) (= |v_#memory_int_234| (store |v_#memory_int_235| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0))))) InVars {#race=|v_#race_757|, #memory_int=|v_#memory_int_235|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_755|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_234|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][193], [477#true, Black: 481#(= |#race~state~0| 0), 33#L767true, 475#true, 479#true, 471#true, 21#L775-2true, 484#true, 238#L763true, 252#L737-1true, 473#true]) [2024-11-10 14:07:39,995 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2024-11-10 14:07:39,995 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2024-11-10 14:07:39,995 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-11-10 14:07:39,995 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2024-11-10 14:07:45,379 INFO L124 PetriNetUnfolderBase]: 21058/101586 cut-off events. [2024-11-10 14:07:45,379 INFO L125 PetriNetUnfolderBase]: For 1902/1902 co-relation queries the response was YES. [2024-11-10 14:07:46,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133033 conditions, 101586 events. 21058/101586 cut-off events. For 1902/1902 co-relation queries the response was YES. Maximal size of possible extension queue 1674. Compared 1577472 event pairs, 10045 based on Foata normal form. 0/88179 useless extension candidates. Maximal degree in co-relation 133025. Up to 25934 conditions per place. [2024-11-10 14:07:46,422 INFO L140 encePairwiseOnDemand]: 474/486 looper letters, 57 selfloop transitions, 11 changer transitions 0/462 dead transitions. [2024-11-10 14:07:46,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 462 transitions, 1146 flow [2024-11-10 14:07:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-10 14:07:46,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2024-11-10 14:07:46,427 INFO L175 Difference]: Start difference. First operand has 427 places, 436 transitions, 948 flow. Second operand 3 states and 1242 transitions. [2024-11-10 14:07:46,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 462 transitions, 1146 flow [2024-11-10 14:07:46,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 462 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:07:46,439 INFO L231 Difference]: Finished difference. Result has 429 places, 446 transitions, 1016 flow [2024-11-10 14:07:46,440 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=429, PETRI_TRANSITIONS=446} [2024-11-10 14:07:46,442 INFO L277 CegarLoopForPetriNet]: 474 programPoint places, -45 predicate places. [2024-11-10 14:07:46,442 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 446 transitions, 1016 flow [2024-11-10 14:07:46,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 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) [2024-11-10 14:07:46,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:46,443 INFO L204 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] [2024-11-10 14:07:46,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:07:46,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err21ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2024-11-10 14:07:46,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash -667485103, now seen corresponding path program 1 times [2024-11-10 14:07:46,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:46,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350827263] [2024-11-10 14:07:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:07:46,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:46,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350827263] [2024-11-10 14:07:46,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350827263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:46,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:46,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:46,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835328143] [2024-11-10 14:07:46,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:46,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:46,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:46,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:46,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:46,508 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 486 [2024-11-10 14:07:46,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 446 transitions, 1016 flow. Second operand has 3 states, 3 states have (on average 397.0) internal successors, (1191), 3 states have internal predecessors, (1191), 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) [2024-11-10 14:07:46,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:46,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 486 [2024-11-10 14:07:46,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:50,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2140] L752-3-->L750: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1) (and (not .cse1) (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|)))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84| 2147483648)) (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84|) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84| 2147483647) (= |v_#race~top~0_29| 0) .cse2) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_85| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_85|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][402], [442#L717-1true, Black: 479#true, 297#L717-1true, 477#true, 489#true, 475#true, Black: 486#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 471#true, 21#L775-2true, 484#true, 423#L750true, 473#true]) [2024-11-10 14:07:50,351 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2024-11-10 14:07:50,351 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2024-11-10 14:07:50,351 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-11-10 14:07:50,351 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2024-11-10 14:07:50,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2140] L752-3-->L750: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1) (and (not .cse1) (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|)))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84| 2147483648)) (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84|) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84| 2147483647) (= |v_#race~top~0_29| 0) .cse2) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_85| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_85|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][402], [265#L717true, Black: 479#true, 297#L717-1true, 477#true, 489#true, 475#true, Black: 486#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 471#true, 21#L775-2true, 484#true, 423#L750true, 473#true]) [2024-11-10 14:07:50,667 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2024-11-10 14:07:50,667 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-10 14:07:50,667 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-11-10 14:07:50,668 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-10 14:07:50,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2140] L752-3-->L750: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1) (and (not .cse1) (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|)))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84| 2147483648)) (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84|) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84| 2147483647) (= |v_#race~top~0_29| 0) .cse2) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_85| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_85|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_84|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][402], [Black: 479#true, 297#L717-1true, 477#true, 489#true, 475#true, Black: 486#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 471#true, 21#L775-2true, 484#true, 423#L750true, 473#true, 295#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-10 14:07:50,668 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2024-11-10 14:07:50,668 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-10 14:07:50,668 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-11-10 14:07:50,669 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event