./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/01_inc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/01_inc.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 dc44c09c63836e77e2249e5abf8328354015a2494c028ff1b2e04f58fa741976 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:24:11,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:24:12,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:24:12,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:24:12,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:24:12,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:24:12,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:24:12,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:24:12,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:24:12,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:24:12,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:24:12,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:24:12,057 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:24:12,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:24:12,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:24:12,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:24:12,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:24:12,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:24:12,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:24:12,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:24:12,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:24:12,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:24:12,059 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:24:12,059 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:24:12,060 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:24:12,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:24:12,060 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:24:12,060 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:24:12,060 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:24:12,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:24:12,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:24:12,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:24:12,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:24:12,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:24:12,061 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:24:12,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:24:12,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:24:12,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:24:12,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:24:12,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:24:12,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:24:12,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:24:12,062 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc44c09c63836e77e2249e5abf8328354015a2494c028ff1b2e04f58fa741976 [2025-03-04 06:24:12,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:24:12,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:24:12,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:24:12,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:24:12,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:24:12,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/01_inc.i [2025-03-04 06:24:13,383 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff2bed69/546e05f7496e4d1bb35ab248e8ccc984/FLAG389fbe175 [2025-03-04 06:24:13,631 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:24:13,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/01_inc.i [2025-03-04 06:24:13,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff2bed69/546e05f7496e4d1bb35ab248e8ccc984/FLAG389fbe175 [2025-03-04 06:24:13,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff2bed69/546e05f7496e4d1bb35ab248e8ccc984 [2025-03-04 06:24:13,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:24:13,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:24:13,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:24:13,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:24:13,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:24:13,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:24:13" (1/1) ... [2025-03-04 06:24:13,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329dcd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:13, skipping insertion in model container [2025-03-04 06:24:13,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:24:13" (1/1) ... [2025-03-04 06:24:13,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:24:14,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:24:14,188 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:24:14,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:24:14,243 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:24:14,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14 WrapperNode [2025-03-04 06:24:14,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:24:14,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:24:14,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:24:14,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:24:14,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (1/1) ... [2025-03-04 06:24:14,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (1/1) ... [2025-03-04 06:24:14,265 INFO L138 Inliner]: procedures = 171, calls = 15, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 84 [2025-03-04 06:24:14,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:24:14,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:24:14,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:24:14,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:24:14,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (1/1) ... [2025-03-04 06:24:14,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (1/1) ... [2025-03-04 06:24:14,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (1/1) ... [2025-03-04 06:24:14,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (1/1) ... [2025-03-04 06:24:14,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (1/1) ... [2025-03-04 06:24:14,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (1/1) ... [2025-03-04 06:24:14,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (1/1) ... [2025-03-04 06:24:14,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (1/1) ... [2025-03-04 06:24:14,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:24:14,284 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:24:14,284 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:24:14,284 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:24:14,284 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (1/1) ... [2025-03-04 06:24:14,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:24:14,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:14,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:24:14,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:24:14,322 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 06:24:14,322 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 06:24:14,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:24:14,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:24:14,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:24:14,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:24:14,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:24:14,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:24:14,323 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:24:14,389 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:24:14,391 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:24:14,516 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:24:14,516 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:24:14,602 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:24:14,603 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:24:14,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:24:14 BoogieIcfgContainer [2025-03-04 06:24:14,603 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:24:14,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:24:14,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:24:14,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:24:14,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:24:13" (1/3) ... [2025-03-04 06:24:14,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eba1741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:24:14, skipping insertion in model container [2025-03-04 06:24:14,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:14" (2/3) ... [2025-03-04 06:24:14,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eba1741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:24:14, skipping insertion in model container [2025-03-04 06:24:14,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:24:14" (3/3) ... [2025-03-04 06:24:14,610 INFO L128 eAbstractionObserver]: Analyzing ICFG 01_inc.i [2025-03-04 06:24:14,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:24:14,622 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 01_inc.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-03-04 06:24:14,622 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:24:14,655 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:24:14,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 53 transitions, 110 flow [2025-03-04 06:24:14,709 INFO L124 PetriNetUnfolderBase]: 1/60 cut-off events. [2025-03-04 06:24:14,711 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:14,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 60 events. 1/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2025-03-04 06:24:14,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 53 transitions, 110 flow [2025-03-04 06:24:14,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 53 transitions, 110 flow [2025-03-04 06:24:14,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:24:14,731 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;@72468248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:24:14,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 06:24:14,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:24:14,736 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-04 06:24:14,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:14,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:14,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:14,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:24:14,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2062455042, now seen corresponding path program 1 times [2025-03-04 06:24:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:14,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14700417] [2025-03-04 06:24:14,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:14,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:14,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 06:24:14,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 06:24:14,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:14,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:14,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14700417] [2025-03-04 06:24:14,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14700417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:14,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:14,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:24:14,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036959568] [2025-03-04 06:24:14,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:14,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:24:14,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:14,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:24:14,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:24:14,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 53 [2025-03-04 06:24:14,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 110 flow. Second operand has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:14,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:14,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 53 [2025-03-04 06:24:14,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:14,905 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2025-03-04 06:24:14,905 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:24:14,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 1/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 6/47 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2025-03-04 06:24:14,907 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 5 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2025-03-04 06:24:14,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 98 flow [2025-03-04 06:24:14,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:24:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:24:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2025-03-04 06:24:14,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8773584905660378 [2025-03-04 06:24:14,916 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 110 flow. Second operand 2 states and 93 transitions. [2025-03-04 06:24:14,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 98 flow [2025-03-04 06:24:14,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 98 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:14,921 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 88 flow [2025-03-04 06:24:14,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-03-04 06:24:14,925 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2025-03-04 06:24:14,925 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 88 flow [2025-03-04 06:24:14,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:14,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:14,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:14,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:24:14,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:24:14,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2039362302, now seen corresponding path program 1 times [2025-03-04 06:24:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:14,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819465835] [2025-03-04 06:24:14,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:14,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:24:14,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:24:14,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:14,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:15,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819465835] [2025-03-04 06:24:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819465835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:15,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:15,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:24:15,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164054158] [2025-03-04 06:24:15,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:15,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:15,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:15,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:15,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:15,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 53 [2025-03-04 06:24:15,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:15,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:15,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 53 [2025-03-04 06:24:15,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:15,050 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2025-03-04 06:24:15,050 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:24:15,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 43 events. 1/43 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 55. Up to 6 conditions per place. [2025-03-04 06:24:15,051 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 7 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-03-04 06:24:15,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 104 flow [2025-03-04 06:24:15,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:24:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:24:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-04 06:24:15,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2025-03-04 06:24:15,053 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 88 flow. Second operand 3 states and 111 transitions. [2025-03-04 06:24:15,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 104 flow [2025-03-04 06:24:15,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:15,055 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 90 flow [2025-03-04 06:24:15,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-03-04 06:24:15,056 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2025-03-04 06:24:15,057 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 90 flow [2025-03-04 06:24:15,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:15,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:15,058 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:15,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:24:15,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:24:15,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:15,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1097723098, now seen corresponding path program 1 times [2025-03-04 06:24:15,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:15,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163729332] [2025-03-04 06:24:15,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:15,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:15,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 06:24:15,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 06:24:15,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:15,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:15,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:24:15,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 06:24:15,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 06:24:15,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:15,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:15,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:24:15,106 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:24:15,106 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-03-04 06:24:15,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-03-04 06:24:15,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-03-04 06:24:15,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-03-04 06:24:15,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-03-04 06:24:15,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:24:15,112 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 06:24:15,115 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:24:15,115 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:24:15,134 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:24:15,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 85 transitions, 180 flow [2025-03-04 06:24:15,153 INFO L124 PetriNetUnfolderBase]: 2/101 cut-off events. [2025-03-04 06:24:15,153 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:24:15,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 101 events. 2/101 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 248 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2025-03-04 06:24:15,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 85 transitions, 180 flow [2025-03-04 06:24:15,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 85 transitions, 180 flow [2025-03-04 06:24:15,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:24:15,161 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;@72468248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:24:15,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-04 06:24:15,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:24:15,167 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-04 06:24:15,167 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:15,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:15,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:15,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:24:15,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:15,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1988279902, now seen corresponding path program 1 times [2025-03-04 06:24:15,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:15,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011448050] [2025-03-04 06:24:15,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:15,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:15,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 06:24:15,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 06:24:15,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:15,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:15,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:15,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011448050] [2025-03-04 06:24:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011448050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:24:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417787808] [2025-03-04 06:24:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:15,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:24:15,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:15,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:24:15,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:24:15,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 85 [2025-03-04 06:24:15,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 180 flow. Second operand has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:15,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:15,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 85 [2025-03-04 06:24:15,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:15,238 INFO L124 PetriNetUnfolderBase]: 26/195 cut-off events. [2025-03-04 06:24:15,238 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 06:24:15,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 195 events. 26/195 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 762 event pairs, 20 based on Foata normal form. 31/196 useless extension candidates. Maximal degree in co-relation 187. Up to 51 conditions per place. [2025-03-04 06:24:15,239 INFO L140 encePairwiseOnDemand]: 70/85 looper letters, 10 selfloop transitions, 0 changer transitions 0/67 dead transitions. [2025-03-04 06:24:15,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 67 transitions, 164 flow [2025-03-04 06:24:15,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:24:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:24:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 145 transitions. [2025-03-04 06:24:15,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8529411764705882 [2025-03-04 06:24:15,240 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 180 flow. Second operand 2 states and 145 transitions. [2025-03-04 06:24:15,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 67 transitions, 164 flow [2025-03-04 06:24:15,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:15,241 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 144 flow [2025-03-04 06:24:15,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-03-04 06:24:15,242 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -17 predicate places. [2025-03-04 06:24:15,242 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 144 flow [2025-03-04 06:24:15,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:15,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:15,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:15,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:24:15,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:24:15,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:15,243 INFO L85 PathProgramCache]: Analyzing trace with hash -523447582, now seen corresponding path program 1 times [2025-03-04 06:24:15,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:15,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864338086] [2025-03-04 06:24:15,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:15,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:15,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:24:15,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:24:15,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:15,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:15,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:15,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864338086] [2025-03-04 06:24:15,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864338086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:15,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:15,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:24:15,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619612958] [2025-03-04 06:24:15,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:15,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:15,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:15,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:15,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:15,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 85 [2025-03-04 06:24:15,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:15,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:15,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 85 [2025-03-04 06:24:15,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:15,384 INFO L124 PetriNetUnfolderBase]: 128/478 cut-off events. [2025-03-04 06:24:15,384 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 06:24:15,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 478 events. 128/478 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2634 event pairs, 45 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 770. Up to 184 conditions per place. [2025-03-04 06:24:15,387 INFO L140 encePairwiseOnDemand]: 69/85 looper letters, 31 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2025-03-04 06:24:15,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 86 transitions, 273 flow [2025-03-04 06:24:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:24:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:24:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-03-04 06:24:15,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2025-03-04 06:24:15,391 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 144 flow. Second operand 3 states and 185 transitions. [2025-03-04 06:24:15,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 86 transitions, 273 flow [2025-03-04 06:24:15,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:15,393 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 248 flow [2025-03-04 06:24:15,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2025-03-04 06:24:15,394 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -13 predicate places. [2025-03-04 06:24:15,394 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 248 flow [2025-03-04 06:24:15,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:15,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:15,394 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:15,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:24:15,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:24:15,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:15,395 INFO L85 PathProgramCache]: Analyzing trace with hash 653827610, now seen corresponding path program 1 times [2025-03-04 06:24:15,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:15,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861245186] [2025-03-04 06:24:15,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:15,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:15,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 06:24:15,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 06:24:15,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:15,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:15,405 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:24:15,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 06:24:15,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 06:24:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:15,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:24:15,412 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:24:15,412 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-03-04 06:24:15,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-03-04 06:24:15,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-03-04 06:24:15,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-03-04 06:24:15,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-03-04 06:24:15,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-03-04 06:24:15,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-03-04 06:24:15,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-03-04 06:24:15,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-03-04 06:24:15,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-03-04 06:24:15,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-03-04 06:24:15,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-03-04 06:24:15,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-03-04 06:24:15,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-03-04 06:24:15,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-03-04 06:24:15,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-03-04 06:24:15,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-03-04 06:24:15,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-03-04 06:24:15,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-03-04 06:24:15,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-03-04 06:24:15,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:24:15,415 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 06:24:15,415 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:24:15,415 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:24:15,434 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:24:15,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 117 transitions, 252 flow [2025-03-04 06:24:15,463 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2025-03-04 06:24:15,464 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:24:15,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 3/142 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 432 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 105. Up to 4 conditions per place. [2025-03-04 06:24:15,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 117 transitions, 252 flow [2025-03-04 06:24:15,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 117 transitions, 252 flow [2025-03-04 06:24:15,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:24:15,466 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;@72468248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:24:15,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-03-04 06:24:15,469 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:24:15,469 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-04 06:24:15,469 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:15,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:15,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:15,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-04 06:24:15,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash -15746689, now seen corresponding path program 1 times [2025-03-04 06:24:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:15,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360297459] [2025-03-04 06:24:15,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:15,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:15,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 06:24:15,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 06:24:15,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:15,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:15,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360297459] [2025-03-04 06:24:15,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360297459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:15,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:15,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:24:15,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138900809] [2025-03-04 06:24:15,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:15,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:24:15,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:15,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:24:15,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:24:15,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 117 [2025-03-04 06:24:15,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 117 transitions, 252 flow. Second operand has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:15,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:15,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 117 [2025-03-04 06:24:15,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:15,596 INFO L124 PetriNetUnfolderBase]: 247/985 cut-off events. [2025-03-04 06:24:15,596 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2025-03-04 06:24:15,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 985 events. 247/985 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7064 event pairs, 220 based on Foata normal form. 156/986 useless extension candidates. Maximal degree in co-relation 1069. Up to 376 conditions per place. [2025-03-04 06:24:15,605 INFO L140 encePairwiseOnDemand]: 95/117 looper letters, 15 selfloop transitions, 0 changer transitions 0/92 dead transitions. [2025-03-04 06:24:15,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 232 flow [2025-03-04 06:24:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:24:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:24:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2025-03-04 06:24:15,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8418803418803419 [2025-03-04 06:24:15,607 INFO L175 Difference]: Start difference. First operand has 121 places, 117 transitions, 252 flow. Second operand 2 states and 197 transitions. [2025-03-04 06:24:15,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 232 flow [2025-03-04 06:24:15,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 92 transitions, 230 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:15,608 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 200 flow [2025-03-04 06:24:15,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=200, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2025-03-04 06:24:15,609 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -24 predicate places. [2025-03-04 06:24:15,609 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 200 flow [2025-03-04 06:24:15,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:15,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:15,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:15,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:24:15,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-04 06:24:15,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2047318115, now seen corresponding path program 1 times [2025-03-04 06:24:15,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:15,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234100912] [2025-03-04 06:24:15,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:15,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:15,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:24:15,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:24:15,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:15,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:15,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:15,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234100912] [2025-03-04 06:24:15,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234100912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:15,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:15,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:24:15,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825735220] [2025-03-04 06:24:15,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:15,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:15,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:15,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:15,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:15,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 117 [2025-03-04 06:24:15,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:15,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:15,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 117 [2025-03-04 06:24:15,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:16,425 INFO L124 PetriNetUnfolderBase]: 3431/7971 cut-off events. [2025-03-04 06:24:16,425 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-03-04 06:24:16,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13745 conditions, 7971 events. 3431/7971 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 73280 event pairs, 1323 based on Foata normal form. 0/7093 useless extension candidates. Maximal degree in co-relation 13739. Up to 3764 conditions per place. [2025-03-04 06:24:16,475 INFO L140 encePairwiseOnDemand]: 93/117 looper letters, 47 selfloop transitions, 18 changer transitions 0/121 dead transitions. [2025-03-04 06:24:16,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 121 transitions, 398 flow [2025-03-04 06:24:16,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:24:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:24:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-03-04 06:24:16,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7065527065527065 [2025-03-04 06:24:16,476 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 200 flow. Second operand 3 states and 248 transitions. [2025-03-04 06:24:16,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 121 transitions, 398 flow [2025-03-04 06:24:16,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 121 transitions, 398 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:16,479 INFO L231 Difference]: Finished difference. Result has 101 places, 110 transitions, 356 flow [2025-03-04 06:24:16,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=101, PETRI_TRANSITIONS=110} [2025-03-04 06:24:16,480 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -20 predicate places. [2025-03-04 06:24:16,480 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 110 transitions, 356 flow [2025-03-04 06:24:16,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:16,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:16,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:16,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:24:16,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-04 06:24:16,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash 773988268, now seen corresponding path program 1 times [2025-03-04 06:24:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:16,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897948256] [2025-03-04 06:24:16,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:16,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:24:16,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:24:16,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:16,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:16,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:16,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897948256] [2025-03-04 06:24:16,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897948256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:16,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:16,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:24:16,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642050178] [2025-03-04 06:24:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:16,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:16,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:16,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:16,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 117 [2025-03-04 06:24:16,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 110 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:16,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:16,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 117 [2025-03-04 06:24:16,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:17,258 INFO L124 PetriNetUnfolderBase]: 4457/10370 cut-off events. [2025-03-04 06:24:17,259 INFO L125 PetriNetUnfolderBase]: For 4811/5147 co-relation queries the response was YES. [2025-03-04 06:24:17,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23050 conditions, 10370 events. 4457/10370 cut-off events. For 4811/5147 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 99364 event pairs, 2184 based on Foata normal form. 55/9142 useless extension candidates. Maximal degree in co-relation 23042. Up to 5401 conditions per place. [2025-03-04 06:24:17,337 INFO L140 encePairwiseOnDemand]: 105/117 looper letters, 46 selfloop transitions, 20 changer transitions 0/136 dead transitions. [2025-03-04 06:24:17,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 136 transitions, 598 flow [2025-03-04 06:24:17,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:24:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:24:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-03-04 06:24:17,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7065527065527065 [2025-03-04 06:24:17,338 INFO L175 Difference]: Start difference. First operand has 101 places, 110 transitions, 356 flow. Second operand 3 states and 248 transitions. [2025-03-04 06:24:17,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 136 transitions, 598 flow [2025-03-04 06:24:17,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 136 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:24:17,362 INFO L231 Difference]: Finished difference. Result has 103 places, 128 transitions, 506 flow [2025-03-04 06:24:17,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=103, PETRI_TRANSITIONS=128} [2025-03-04 06:24:17,364 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -18 predicate places. [2025-03-04 06:24:17,364 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 128 transitions, 506 flow [2025-03-04 06:24:17,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:17,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:17,365 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:17,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:24:17,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-04 06:24:17,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:17,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1042761017, now seen corresponding path program 1 times [2025-03-04 06:24:17,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:17,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718918771] [2025-03-04 06:24:17,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:17,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:17,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:24:17,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:24:17,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:17,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:17,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:24:17,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:24:17,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:24:17,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:17,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:17,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:24:17,390 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:24:17,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 41 remaining) [2025-03-04 06:24:17,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 41 remaining) [2025-03-04 06:24:17,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (38 of 41 remaining) [2025-03-04 06:24:17,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (37 of 41 remaining) [2025-03-04 06:24:17,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (36 of 41 remaining) [2025-03-04 06:24:17,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (35 of 41 remaining) [2025-03-04 06:24:17,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (34 of 41 remaining) [2025-03-04 06:24:17,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (33 of 41 remaining) [2025-03-04 06:24:17,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (32 of 41 remaining) [2025-03-04 06:24:17,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (31 of 41 remaining) [2025-03-04 06:24:17,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (30 of 41 remaining) [2025-03-04 06:24:17,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (29 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (28 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (27 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (24 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (23 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (22 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (21 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (19 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (18 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (17 of 41 remaining) [2025-03-04 06:24:17,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (13 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (12 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 41 remaining) [2025-03-04 06:24:17,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 41 remaining) [2025-03-04 06:24:17,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 41 remaining) [2025-03-04 06:24:17,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 41 remaining) [2025-03-04 06:24:17,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 41 remaining) [2025-03-04 06:24:17,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 41 remaining) [2025-03-04 06:24:17,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:24:17,394 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 06:24:17,395 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:24:17,395 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 06:24:17,429 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:24:17,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 149 transitions, 326 flow [2025-03-04 06:24:17,448 INFO L124 PetriNetUnfolderBase]: 4/183 cut-off events. [2025-03-04 06:24:17,448 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:24:17,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 183 events. 4/183 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 618 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 5 conditions per place. [2025-03-04 06:24:17,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 149 transitions, 326 flow [2025-03-04 06:24:17,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 149 transitions, 326 flow [2025-03-04 06:24:17,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:24:17,454 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;@72468248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:24:17,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-03-04 06:24:17,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:24:17,456 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-04 06:24:17,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:17,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:17,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:17,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:24:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash 515461343, now seen corresponding path program 1 times [2025-03-04 06:24:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839879765] [2025-03-04 06:24:17,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:17,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 06:24:17,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 06:24:17,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:17,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:17,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839879765] [2025-03-04 06:24:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839879765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:17,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:17,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:24:17,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827046522] [2025-03-04 06:24:17,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:17,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:24:17,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:17,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:24:17,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:24:17,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 149 [2025-03-04 06:24:17,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 149 transitions, 326 flow. Second operand has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:17,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:17,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 149 [2025-03-04 06:24:17,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:18,030 INFO L124 PetriNetUnfolderBase]: 1832/5215 cut-off events. [2025-03-04 06:24:18,031 INFO L125 PetriNetUnfolderBase]: For 1422/1422 co-relation queries the response was YES. [2025-03-04 06:24:18,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8463 conditions, 5215 events. 1832/5215 cut-off events. For 1422/1422 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 49726 event pairs, 1720 based on Foata normal form. 781/5255 useless extension candidates. Maximal degree in co-relation 6111. Up to 2501 conditions per place. [2025-03-04 06:24:18,061 INFO L140 encePairwiseOnDemand]: 120/149 looper letters, 20 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2025-03-04 06:24:18,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 302 flow [2025-03-04 06:24:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:24:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:24:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 249 transitions. [2025-03-04 06:24:18,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8355704697986577 [2025-03-04 06:24:18,063 INFO L175 Difference]: Start difference. First operand has 154 places, 149 transitions, 326 flow. Second operand 2 states and 249 transitions. [2025-03-04 06:24:18,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 302 flow [2025-03-04 06:24:18,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 296 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:18,065 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 256 flow [2025-03-04 06:24:18,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=256, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2025-03-04 06:24:18,066 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, -31 predicate places. [2025-03-04 06:24:18,067 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 256 flow [2025-03-04 06:24:18,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:18,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:18,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:18,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:24:18,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:24:18,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1437134403, now seen corresponding path program 1 times [2025-03-04 06:24:18,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:18,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793171767] [2025-03-04 06:24:18,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:18,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:24:18,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:24:18,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:18,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:18,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:18,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793171767] [2025-03-04 06:24:18,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793171767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:18,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:18,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:24:18,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638237535] [2025-03-04 06:24:18,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:18,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:18,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:18,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:18,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:18,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 149 [2025-03-04 06:24:18,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:18,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:18,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 149 [2025-03-04 06:24:18,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:25,587 INFO L124 PetriNetUnfolderBase]: 69458/129143 cut-off events. [2025-03-04 06:24:25,587 INFO L125 PetriNetUnfolderBase]: For 6313/6313 co-relation queries the response was YES. [2025-03-04 06:24:26,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231078 conditions, 129143 events. 69458/129143 cut-off events. For 6313/6313 co-relation queries the response was YES. Maximal size of possible extension queue 5057. Compared 1453418 event pairs, 26953 based on Foata normal form. 0/114804 useless extension candidates. Maximal degree in co-relation 231071. Up to 66562 conditions per place. [2025-03-04 06:24:27,003 INFO L140 encePairwiseOnDemand]: 117/149 looper letters, 63 selfloop transitions, 24 changer transitions 0/156 dead transitions. [2025-03-04 06:24:27,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 156 transitions, 523 flow [2025-03-04 06:24:27,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:24:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:24:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2025-03-04 06:24:27,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957494407158836 [2025-03-04 06:24:27,007 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 256 flow. Second operand 3 states and 311 transitions. [2025-03-04 06:24:27,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 156 transitions, 523 flow [2025-03-04 06:24:27,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 156 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:27,014 INFO L231 Difference]: Finished difference. Result has 127 places, 141 transitions, 464 flow [2025-03-04 06:24:27,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=127, PETRI_TRANSITIONS=141} [2025-03-04 06:24:27,016 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, -27 predicate places. [2025-03-04 06:24:27,016 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 141 transitions, 464 flow [2025-03-04 06:24:27,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:27,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:27,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:27,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:24:27,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:24:27,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -954585204, now seen corresponding path program 1 times [2025-03-04 06:24:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:27,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952347679] [2025-03-04 06:24:27,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:27,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:27,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:24:27,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:24:27,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:27,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:27,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:27,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952347679] [2025-03-04 06:24:27,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952347679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:27,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:27,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:24:27,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702300845] [2025-03-04 06:24:27,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:27,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:27,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:27,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:27,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:27,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 149 [2025-03-04 06:24:27,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 141 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:27,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:27,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 149 [2025-03-04 06:24:27,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:38,732 INFO L124 PetriNetUnfolderBase]: 88896/171094 cut-off events. [2025-03-04 06:24:38,733 INFO L125 PetriNetUnfolderBase]: For 87260/93447 co-relation queries the response was YES. [2025-03-04 06:24:39,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397988 conditions, 171094 events. 88896/171094 cut-off events. For 87260/93447 co-relation queries the response was YES. Maximal size of possible extension queue 6400. Compared 2049247 event pairs, 45273 based on Foata normal form. 658/149506 useless extension candidates. Maximal degree in co-relation 397979. Up to 95998 conditions per place. [2025-03-04 06:24:40,503 INFO L140 encePairwiseOnDemand]: 133/149 looper letters, 62 selfloop transitions, 28 changer transitions 0/179 dead transitions. [2025-03-04 06:24:40,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 179 transitions, 807 flow [2025-03-04 06:24:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:24:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:24:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2025-03-04 06:24:40,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7046979865771812 [2025-03-04 06:24:40,504 INFO L175 Difference]: Start difference. First operand has 127 places, 141 transitions, 464 flow. Second operand 3 states and 315 transitions. [2025-03-04 06:24:40,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 179 transitions, 807 flow [2025-03-04 06:24:40,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 179 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:24:40,935 INFO L231 Difference]: Finished difference. Result has 129 places, 167 transitions, 682 flow [2025-03-04 06:24:40,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=129, PETRI_TRANSITIONS=167} [2025-03-04 06:24:40,935 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, -25 predicate places. [2025-03-04 06:24:40,935 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 167 transitions, 682 flow [2025-03-04 06:24:40,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:40,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:40,936 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:40,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:24:40,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:24:40,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:40,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1464847456, now seen corresponding path program 1 times [2025-03-04 06:24:40,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:40,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851349375] [2025-03-04 06:24:40,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:40,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:24:40,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:24:40,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:40,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:40,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851349375] [2025-03-04 06:24:40,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851349375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:40,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:40,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:24:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936734190] [2025-03-04 06:24:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:40,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:40,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:40,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:40,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:40,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 149 [2025-03-04 06:24:40,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 167 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:40,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:40,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 149 [2025-03-04 06:24:40,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:46,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L718-2-->L718-1: Formula: (= |v_#race~value~0_12| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_12|} AuxVars[] AssignedVars[#race~value~0][73], [Black: 159#true, 122#L720true, 164#true, 157#true, Black: 166#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 3#L722-1true, 149#true, 151#true, 153#true, 155#true, 146#L733-2true, 143#L718-1true, 169#true, 13#L724-1true]) [2025-03-04 06:24:46,220 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2025-03-04 06:24:46,220 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2025-03-04 06:24:46,221 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2025-03-04 06:24:46,221 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2025-03-04 06:24:48,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L723-2-->L723: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_6|) InVars {thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_6|} AuxVars[] AssignedVars[#race~value~0][194], [Black: 161#(= |#race~value~0| 0), 132#L720true, 164#true, 157#true, Black: 166#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 66#L723-1true, 149#true, 151#true, 153#true, 155#true, 146#L733-2true, 90#L723true, 49#L720true, 169#true]) [2025-03-04 06:24:48,442 INFO L294 olderBase$Statistics]: this new event has 72 ancestors and is cut-off event [2025-03-04 06:24:48,442 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-04 06:24:48,442 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-04 06:24:48,442 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-04 06:24:49,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([708] L725-->L728: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][199], [Black: 159#true, 164#true, 157#true, 79#L728true, Black: 166#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 6#L718true, 66#L723-1true, 149#true, 151#true, 153#true, 155#true, 146#L733-2true, 115#L718true, 169#true]) [2025-03-04 06:24:49,966 INFO L294 olderBase$Statistics]: this new event has 72 ancestors and is cut-off event [2025-03-04 06:24:49,966 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-04 06:24:49,966 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-04 06:24:49,966 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-04 06:24:50,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([599] L722-2-->L722: Formula: (= |v_#race~value~0_9| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_9|} AuxVars[] AssignedVars[#race~value~0][149], [Black: 159#true, 164#true, 157#true, Black: 166#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 6#L718true, 50#L725true, 66#L723-1true, 149#true, 151#true, 153#true, 155#true, 146#L733-2true, 67#L722true, 169#true]) [2025-03-04 06:24:50,436 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,436 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,436 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,436 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([630] L722-2-->L722: Formula: (= |v_#race~value~0_9| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_9|} AuxVars[] AssignedVars[#race~value~0][180], [Black: 159#true, 164#true, 157#true, Black: 166#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 66#L723-1true, 50#L725true, 149#true, 151#true, 153#true, 155#true, 146#L733-2true, 115#L718true, 147#L722true, 169#true]) [2025-03-04 06:24:50,438 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,438 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,438 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,438 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,553 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([708] L725-->L728: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][125], [Black: 159#true, 32#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 164#true, 157#true, Black: 166#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 79#L728true, 47#thr1Err7ASSERT_VIOLATIONDATA_RACEtrue, 149#true, 151#true, 153#true, 155#true, 146#L733-2true, 115#L718true, 169#true]) [2025-03-04 06:24:50,553 INFO L294 olderBase$Statistics]: this new event has 72 ancestors and is cut-off event [2025-03-04 06:24:50,553 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-04 06:24:50,553 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-04 06:24:50,553 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-04 06:24:50,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([700] L723-2-->L723: Formula: (= |v_#race~value~0_6| |v_thr1Thread2of4ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_6|} AuxVars[] AssignedVars[#race~value~0][144], [Black: 161#(= |#race~value~0| 0), 132#L720true, 164#true, 77#L723true, 157#true, Black: 166#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 66#L723-1true, 43#L722-1true, 149#true, 151#true, 153#true, 155#true, 146#L733-2true, 171#(= |#race~value~0| |thr1Thread2of4ForFork0_#t~nondet6#1|)]) [2025-03-04 06:24:50,558 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,558 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,558 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,558 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-04 06:24:50,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([708] L725-->L728: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][125], [Black: 159#true, 32#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 164#true, Black: 166#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 79#L728true, 157#true, 6#L718true, 149#true, 151#true, 108#thr1Err7ASSERT_VIOLATIONDATA_RACEtrue, 153#true, 155#true, 146#L733-2true, 169#true]) [2025-03-04 06:24:50,589 INFO L294 olderBase$Statistics]: this new event has 72 ancestors and is cut-off event [2025-03-04 06:24:50,589 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-04 06:24:50,589 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-04 06:24:50,589 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event