./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/dekker-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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-atomic/dekker-b.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 ee2c91df2652a75c113f2667be77b799d83dae8d01b1c36baa45b8c25ceec25f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:43:04,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:43:04,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:43:04,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:43:04,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:43:04,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:43:04,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:43:04,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:43:04,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:43:04,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:43:04,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:43:04,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:43:04,229 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:43:04,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:43:04,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:43:04,230 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:43:04,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:43:04,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:43:04,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:43:04,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:43:04,231 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:43:04,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:43:04,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:43:04,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:43:04,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:43:04,232 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 -> ee2c91df2652a75c113f2667be77b799d83dae8d01b1c36baa45b8c25ceec25f [2025-03-17 10:43:04,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:43:04,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:43:04,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:43:04,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:43:04,473 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:43:04,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/dekker-b.i [2025-03-17 10:43:05,606 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f012911/a5b6141b173540859fa03b72fcdee85c/FLAG192fe60cb [2025-03-17 10:43:05,866 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:43:05,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-b.i [2025-03-17 10:43:05,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f012911/a5b6141b173540859fa03b72fcdee85c/FLAG192fe60cb [2025-03-17 10:43:06,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f012911/a5b6141b173540859fa03b72fcdee85c [2025-03-17 10:43:06,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:43:06,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:43:06,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:43:06,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:43:06,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:43:06,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b90895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06, skipping insertion in model container [2025-03-17 10:43:06,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:43:06,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:43:06,460 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:43:06,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:43:06,514 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:43:06,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06 WrapperNode [2025-03-17 10:43:06,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:43:06,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:43:06,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:43:06,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:43:06,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,542 INFO L138 Inliner]: procedures = 161, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2025-03-17 10:43:06,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:43:06,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:43:06,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:43:06,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:43:06,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:43:06,561 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:43:06,561 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:43:06,561 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:43:06,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (1/1) ... [2025-03-17 10:43:06,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:43:06,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:43:06,584 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-17 10:43:06,586 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-17 10:43:06,600 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-17 10:43:06,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-17 10:43:06,600 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 10:43:06,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 10:43:06,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:43:06,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:43:06,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:43:06,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:43:06,601 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:43:06,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:43:06,679 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:43:06,862 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:43:06,862 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:43:06,872 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:43:06,873 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:43:06,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:43:06 BoogieIcfgContainer [2025-03-17 10:43:06,873 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:43:06,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:43:06,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:43:06,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:43:06,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:43:06" (1/3) ... [2025-03-17 10:43:06,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c56c602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:43:06, skipping insertion in model container [2025-03-17 10:43:06,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:06" (2/3) ... [2025-03-17 10:43:06,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c56c602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:43:06, skipping insertion in model container [2025-03-17 10:43:06,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:43:06" (3/3) ... [2025-03-17 10:43:06,880 INFO L128 eAbstractionObserver]: Analyzing ICFG dekker-b.i [2025-03-17 10:43:06,890 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:43:06,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dekker-b.i that has 3 procedures, 170 locations, 1 initial locations, 4 loop locations, and 22 error locations. [2025-03-17 10:43:06,893 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:43:06,961 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 10:43:06,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 185 transitions, 384 flow [2025-03-17 10:43:07,049 INFO L124 PetriNetUnfolderBase]: 16/183 cut-off events. [2025-03-17 10:43:07,051 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:43:07,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 16/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 142. Up to 3 conditions per place. [2025-03-17 10:43:07,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 185 transitions, 384 flow [2025-03-17 10:43:07,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 178 transitions, 365 flow [2025-03-17 10:43:07,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:43:07,077 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;@5d40fe72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:43:07,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-17 10:43:07,081 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:43:07,081 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 10:43:07,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:43:07,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:07,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:43:07,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err9ASSERT_VIOLATIONDATA_RACE, thr2Err8ASSERT_VIOLATIONDATA_RACE, thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-17 10:43:07,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:07,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1438456026, now seen corresponding path program 1 times [2025-03-17 10:43:07,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:07,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991803306] [2025-03-17 10:43:07,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:07,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:07,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 10:43:07,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 10:43:07,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:07,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:07,228 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-17 10:43:07,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:07,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991803306] [2025-03-17 10:43:07,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991803306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:07,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:07,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:43:07,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444442991] [2025-03-17 10:43:07,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:07,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:43:07,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:07,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:43:07,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:43:07,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 185 [2025-03-17 10:43:07,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 178 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-17 10:43:07,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:07,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 185 [2025-03-17 10:43:07,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:07,470 INFO L124 PetriNetUnfolderBase]: 98/790 cut-off events. [2025-03-17 10:43:07,471 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-03-17 10:43:07,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 790 events. 98/790 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4946 event pairs, 23 based on Foata normal form. 67/688 useless extension candidates. Maximal degree in co-relation 812. Up to 99 conditions per place. [2025-03-17 10:43:07,480 INFO L140 encePairwiseOnDemand]: 159/185 looper letters, 22 selfloop transitions, 11 changer transitions 1/177 dead transitions. [2025-03-17 10:43:07,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 435 flow [2025-03-17 10:43:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:43:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:43:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2025-03-17 10:43:07,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9225225225225225 [2025-03-17 10:43:07,498 INFO L175 Difference]: Start difference. First operand has 169 places, 178 transitions, 365 flow. Second operand 3 states and 512 transitions. [2025-03-17 10:43:07,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 177 transitions, 435 flow [2025-03-17 10:43:07,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 177 transitions, 427 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 10:43:07,507 INFO L231 Difference]: Finished difference. Result has 166 places, 174 transitions, 424 flow [2025-03-17 10:43:07,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=166, PETRI_TRANSITIONS=174} [2025-03-17 10:43:07,511 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, -3 predicate places. [2025-03-17 10:43:07,512 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 174 transitions, 424 flow [2025-03-17 10:43:07,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-17 10:43:07,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:07,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:43:07,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:43:07,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr2Err9ASSERT_VIOLATIONDATA_RACE, thr2Err8ASSERT_VIOLATIONDATA_RACE, thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-17 10:43:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash -173708133, now seen corresponding path program 1 times [2025-03-17 10:43:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744209780] [2025-03-17 10:43:07,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:07,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 10:43:07,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 10:43:07,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:07,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:07,617 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-17 10:43:07,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744209780] [2025-03-17 10:43:07,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744209780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:07,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:07,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:43:07,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057851952] [2025-03-17 10:43:07,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:07,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:43:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:07,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:43:07,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:43:07,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 185 [2025-03-17 10:43:07,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 174 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 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-17 10:43:07,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:07,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 185 [2025-03-17 10:43:07,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:07,733 INFO L124 PetriNetUnfolderBase]: 63/589 cut-off events. [2025-03-17 10:43:07,734 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-17 10:43:07,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 589 events. 63/589 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3397 event pairs, 13 based on Foata normal form. 6/488 useless extension candidates. Maximal degree in co-relation 686. Up to 53 conditions per place. [2025-03-17 10:43:07,738 INFO L140 encePairwiseOnDemand]: 176/185 looper letters, 12 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-03-17 10:43:07,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 156 transitions, 411 flow [2025-03-17 10:43:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:43:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 10:43:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2025-03-17 10:43:07,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8716216216216216 [2025-03-17 10:43:07,742 INFO L175 Difference]: Start difference. First operand has 166 places, 174 transitions, 424 flow. Second operand 4 states and 645 transitions. [2025-03-17 10:43:07,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 156 transitions, 411 flow [2025-03-17 10:43:07,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 156 transitions, 393 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:43:07,747 INFO L231 Difference]: Finished difference. Result has 152 places, 154 transitions, 376 flow [2025-03-17 10:43:07,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=376, PETRI_PLACES=152, PETRI_TRANSITIONS=154} [2025-03-17 10:43:07,749 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, -17 predicate places. [2025-03-17 10:43:07,749 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 154 transitions, 376 flow [2025-03-17 10:43:07,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 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-17 10:43:07,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:07,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:43:07,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:43:07,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr2Err9ASSERT_VIOLATIONDATA_RACE, thr2Err8ASSERT_VIOLATIONDATA_RACE, thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-17 10:43:07,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:07,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1424893058, now seen corresponding path program 1 times [2025-03-17 10:43:07,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:07,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195371463] [2025-03-17 10:43:07,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:07,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:07,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 10:43:07,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 10:43:07,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:07,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:07,818 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-17 10:43:07,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:07,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195371463] [2025-03-17 10:43:07,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195371463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:07,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:07,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:43:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839886171] [2025-03-17 10:43:07,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:07,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:43:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:07,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:43:07,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:43:07,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2025-03-17 10:43:07,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 154 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-17 10:43:07,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:07,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2025-03-17 10:43:07,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:07,924 INFO L124 PetriNetUnfolderBase]: 65/767 cut-off events. [2025-03-17 10:43:07,924 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-17 10:43:07,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 767 events. 65/767 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4822 event pairs, 15 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 777. Up to 64 conditions per place. [2025-03-17 10:43:07,928 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 10 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2025-03-17 10:43:07,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 158 transitions, 414 flow [2025-03-17 10:43:07,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:43:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:43:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2025-03-17 10:43:07,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9081081081081082 [2025-03-17 10:43:07,931 INFO L175 Difference]: Start difference. First operand has 152 places, 154 transitions, 376 flow. Second operand 3 states and 504 transitions. [2025-03-17 10:43:07,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 158 transitions, 414 flow [2025-03-17 10:43:07,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 158 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:43:07,936 INFO L231 Difference]: Finished difference. Result has 154 places, 157 transitions, 399 flow [2025-03-17 10:43:07,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=154, PETRI_TRANSITIONS=157} [2025-03-17 10:43:07,939 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, -15 predicate places. [2025-03-17 10:43:07,939 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 157 transitions, 399 flow [2025-03-17 10:43:07,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-17 10:43:07,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:07,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:43:07,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:43:07,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr2Err9ASSERT_VIOLATIONDATA_RACE, thr2Err8ASSERT_VIOLATIONDATA_RACE, thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-17 10:43:07,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1827709688, now seen corresponding path program 1 times [2025-03-17 10:43:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112403962] [2025-03-17 10:43:07,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:07,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 10:43:07,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 10:43:07,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:07,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:43:07,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:07,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112403962] [2025-03-17 10:43:07,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112403962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:07,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:07,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:43:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983990713] [2025-03-17 10:43:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:07,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:43:07,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:07,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:43:07,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:43:07,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2025-03-17 10:43:07,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 157 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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-17 10:43:07,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:07,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2025-03-17 10:43:08,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:08,104 INFO L124 PetriNetUnfolderBase]: 121/1159 cut-off events. [2025-03-17 10:43:08,104 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-17 10:43:08,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 1159 events. 121/1159 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 8892 event pairs, 19 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 1424. Up to 104 conditions per place. [2025-03-17 10:43:08,111 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 12 selfloop transitions, 6 changer transitions 0/165 dead transitions. [2025-03-17 10:43:08,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 165 transitions, 454 flow [2025-03-17 10:43:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:43:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:43:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-03-17 10:43:08,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9261261261261261 [2025-03-17 10:43:08,114 INFO L175 Difference]: Start difference. First operand has 154 places, 157 transitions, 399 flow. Second operand 3 states and 514 transitions. [2025-03-17 10:43:08,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 165 transitions, 454 flow [2025-03-17 10:43:08,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 165 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:43:08,119 INFO L231 Difference]: Finished difference. Result has 156 places, 163 transitions, 441 flow [2025-03-17 10:43:08,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=156, PETRI_TRANSITIONS=163} [2025-03-17 10:43:08,119 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, -13 predicate places. [2025-03-17 10:43:08,120 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 163 transitions, 441 flow [2025-03-17 10:43:08,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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-17 10:43:08,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:08,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:43:08,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:43:08,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err9ASSERT_VIOLATIONDATA_RACE === [thr2Err9ASSERT_VIOLATIONDATA_RACE, thr2Err8ASSERT_VIOLATIONDATA_RACE, thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-17 10:43:08,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1237340783, now seen corresponding path program 1 times [2025-03-17 10:43:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126062345] [2025-03-17 10:43:08,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:08,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 10:43:08,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 10:43:08,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:08,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:08,171 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-17 10:43:08,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:08,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126062345] [2025-03-17 10:43:08,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126062345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:08,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:08,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:43:08,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209302060] [2025-03-17 10:43:08,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:08,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:43:08,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:08,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:43:08,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:43:08,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2025-03-17 10:43:08,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 163 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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-17 10:43:08,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:08,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2025-03-17 10:43:08,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:08,286 INFO L124 PetriNetUnfolderBase]: 157/1271 cut-off events. [2025-03-17 10:43:08,286 INFO L125 PetriNetUnfolderBase]: For 200/214 co-relation queries the response was YES. [2025-03-17 10:43:08,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 1271 events. 157/1271 cut-off events. For 200/214 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 9940 event pairs, 29 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1078. Up to 133 conditions per place. [2025-03-17 10:43:08,292 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 16 selfloop transitions, 6 changer transitions 0/168 dead transitions. [2025-03-17 10:43:08,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 168 transitions, 502 flow [2025-03-17 10:43:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:43:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:43:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-03-17 10:43:08,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9117117117117117 [2025-03-17 10:43:08,294 INFO L175 Difference]: Start difference. First operand has 156 places, 163 transitions, 441 flow. Second operand 3 states and 506 transitions. [2025-03-17 10:43:08,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 168 transitions, 502 flow [2025-03-17 10:43:08,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 168 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:43:08,297 INFO L231 Difference]: Finished difference. Result has 158 places, 167 transitions, 475 flow [2025-03-17 10:43:08,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=475, PETRI_PLACES=158, PETRI_TRANSITIONS=167} [2025-03-17 10:43:08,298 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, -11 predicate places. [2025-03-17 10:43:08,298 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 167 transitions, 475 flow [2025-03-17 10:43:08,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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-17 10:43:08,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:08,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:43:08,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:43:08,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr2Err9ASSERT_VIOLATIONDATA_RACE, thr2Err8ASSERT_VIOLATIONDATA_RACE, thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-17 10:43:08,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1492163917, now seen corresponding path program 1 times [2025-03-17 10:43:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172564445] [2025-03-17 10:43:08,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:08,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 10:43:08,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 10:43:08,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:08,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:08,349 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-17 10:43:08,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:08,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172564445] [2025-03-17 10:43:08,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172564445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:08,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:08,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:43:08,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703434429] [2025-03-17 10:43:08,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:08,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:43:08,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:08,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:43:08,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:43:08,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2025-03-17 10:43:08,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 167 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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-17 10:43:08,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:08,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2025-03-17 10:43:08,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:08,458 INFO L124 PetriNetUnfolderBase]: 174/1519 cut-off events. [2025-03-17 10:43:08,458 INFO L125 PetriNetUnfolderBase]: For 85/88 co-relation queries the response was YES. [2025-03-17 10:43:08,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 1519 events. 174/1519 cut-off events. For 85/88 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 12876 event pairs, 42 based on Foata normal form. 0/1246 useless extension candidates. Maximal degree in co-relation 1514. Up to 146 conditions per place. [2025-03-17 10:43:08,467 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 11 selfloop transitions, 5 changer transitions 0/172 dead transitions. [2025-03-17 10:43:08,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 172 transitions, 519 flow [2025-03-17 10:43:08,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:43:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:43:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2025-03-17 10:43:08,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171171171171171 [2025-03-17 10:43:08,469 INFO L175 Difference]: Start difference. First operand has 158 places, 167 transitions, 475 flow. Second operand 3 states and 509 transitions. [2025-03-17 10:43:08,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 172 transitions, 519 flow [2025-03-17 10:43:08,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 172 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:43:08,474 INFO L231 Difference]: Finished difference. Result has 160 places, 171 transitions, 501 flow [2025-03-17 10:43:08,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=160, PETRI_TRANSITIONS=171} [2025-03-17 10:43:08,475 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, -9 predicate places. [2025-03-17 10:43:08,475 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 171 transitions, 501 flow [2025-03-17 10:43:08,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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-17 10:43:08,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:08,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:43:08,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:43:08,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr2Err8ASSERT_VIOLATIONDATA_RACE === [thr2Err9ASSERT_VIOLATIONDATA_RACE, thr2Err8ASSERT_VIOLATIONDATA_RACE, thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-17 10:43:08,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2085374855, now seen corresponding path program 1 times [2025-03-17 10:43:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:08,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941214238] [2025-03-17 10:43:08,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:08,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:08,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 10:43:08,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 10:43:08,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:08,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:08,515 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-17 10:43:08,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:08,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941214238] [2025-03-17 10:43:08,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941214238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:08,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:08,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:43:08,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158134077] [2025-03-17 10:43:08,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:08,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:43:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:08,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:43:08,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:43:08,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2025-03-17 10:43:08,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 171 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-17 10:43:08,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:08,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2025-03-17 10:43:08,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:08,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([381] L710-2-->L710-1: Formula: (= |v_#race~turn~0_9| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_9|} AuxVars[] AssignedVars[#race~turn~0][133], [Black: 194#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 197#true, 95#L726-1true, Black: 204#(= |thr2Thread1of1ForFork1_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 179#true, 175#true, 67#L703true, 135#L710-1true, 207#true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-03-17 10:43:08,624 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-03-17 10:43:08,624 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,624 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,624 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L703-2-->L703: Formula: (= |v_#race~turn~0_12| |v_thr1Thread1of1ForFork0_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet5#1=|v_thr1Thread1of1ForFork0_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_12|, thr1Thread1of1ForFork0_#t~nondet5#1=|v_thr1Thread1of1ForFork0_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][101], [Black: 194#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 197#true, 95#L726-1true, Black: 204#(= |thr2Thread1of1ForFork1_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 175#true, 67#L703true, 135#L710-1true, 207#true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-03-17 10:43:08,630 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-03-17 10:43:08,630 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,630 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,630 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L710-->L709: Formula: (= v_~turn~0_5 1) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5} AuxVars[] AssignedVars[][128], [113#L703-3true, Black: 194#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 197#true, 102#L709true, 95#L726-1true, Black: 204#(= |thr2Thread1of1ForFork1_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 179#true, 175#true, 207#true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-03-17 10:43:08,634 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-03-17 10:43:08,634 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,634 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,634 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L703-2-->L703: Formula: (= |v_#race~turn~0_12| |v_thr1Thread1of1ForFork0_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet5#1=|v_thr1Thread1of1ForFork0_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_12|, thr1Thread1of1ForFork0_#t~nondet5#1=|v_thr1Thread1of1ForFork0_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][101], [Black: 194#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 197#true, 95#L726-1true, Black: 204#(= |thr2Thread1of1ForFork1_#t~nondet7#1| |#race~flag2~0|), 57#L710true, 214#(= |#race~flag1~0| 0), Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 175#true, 67#L703true, 207#true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-03-17 10:43:08,635 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-03-17 10:43:08,635 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-03-17 10:43:08,635 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-03-17 10:43:08,635 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-03-17 10:43:08,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L704-2-->L704: Formula: (= |v_#race~flag1~0_6| |v_thr1Thread1of1ForFork0_#t~nondet6#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet6#1=|v_thr1Thread1of1ForFork0_#t~nondet6#1_3|} OutVars{#race~flag1~0=|v_#race~flag1~0_6|, thr1Thread1of1ForFork0_#t~nondet6#1=|v_thr1Thread1of1ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~flag1~0][146], [Black: 194#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 122#L704true, Black: 197#true, 95#L726-1true, Black: 204#(= |thr2Thread1of1ForFork1_#t~nondet7#1| |#race~flag2~0|), Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 140#L709-1true, Black: 181#(= |#race~turn~0| 0), 175#true, 207#true, 184#true, Black: 186#(= ~turn~0 0), 212#true]) [2025-03-17 10:43:08,635 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-03-17 10:43:08,635 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-03-17 10:43:08,635 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-03-17 10:43:08,635 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-03-17 10:43:08,695 INFO L124 PetriNetUnfolderBase]: 289/2283 cut-off events. [2025-03-17 10:43:08,695 INFO L125 PetriNetUnfolderBase]: For 166/175 co-relation queries the response was YES. [2025-03-17 10:43:08,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3345 conditions, 2283 events. 289/2283 cut-off events. For 166/175 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 21805 event pairs, 40 based on Foata normal form. 2/1879 useless extension candidates. Maximal degree in co-relation 3224. Up to 193 conditions per place. [2025-03-17 10:43:08,707 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 9 selfloop transitions, 5 changer transitions 0/176 dead transitions. [2025-03-17 10:43:08,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 176 transitions, 544 flow [2025-03-17 10:43:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:43:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:43:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2025-03-17 10:43:08,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171171171171171 [2025-03-17 10:43:08,709 INFO L175 Difference]: Start difference. First operand has 160 places, 171 transitions, 501 flow. Second operand 3 states and 509 transitions. [2025-03-17 10:43:08,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 176 transitions, 544 flow [2025-03-17 10:43:08,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 176 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:43:08,713 INFO L231 Difference]: Finished difference. Result has 162 places, 175 transitions, 533 flow [2025-03-17 10:43:08,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=162, PETRI_TRANSITIONS=175} [2025-03-17 10:43:08,715 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, -7 predicate places. [2025-03-17 10:43:08,715 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 175 transitions, 533 flow [2025-03-17 10:43:08,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-17 10:43:08,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:08,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:43:08,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:43:08,717 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err9ASSERT_VIOLATIONDATA_RACE, thr2Err8ASSERT_VIOLATIONDATA_RACE, thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-17 10:43:08,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:08,718 INFO L85 PathProgramCache]: Analyzing trace with hash 144159838, now seen corresponding path program 1 times [2025-03-17 10:43:08,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:08,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909711807] [2025-03-17 10:43:08,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:08,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:08,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 10:43:08,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 10:43:08,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:08,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:08,760 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-17 10:43:08,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909711807] [2025-03-17 10:43:08,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909711807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:08,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:08,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:43:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683539435] [2025-03-17 10:43:08,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:08,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:43:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:08,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:43:08,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:43:08,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2025-03-17 10:43:08,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 175 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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-17 10:43:08,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:08,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2025-03-17 10:43:08,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:08,869 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([381] L710-2-->L710-1: Formula: (= |v_#race~turn~0_9| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_9|} AuxVars[] AssignedVars[#race~turn~0][137], [Black: 194#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 197#true, 95#L726-1true, 219#(= |#race~x~0| 0), Black: 204#(= |thr2Thread1of1ForFork1_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 179#true, 67#L703true, Black: 212#true, 175#true, 135#L710-1true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-03-17 10:43:08,869 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-03-17 10:43:08,869 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,869 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,869 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L703-2-->L703: Formula: (= |v_#race~turn~0_12| |v_thr1Thread1of1ForFork0_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet5#1=|v_thr1Thread1of1ForFork0_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_12|, thr1Thread1of1ForFork0_#t~nondet5#1=|v_thr1Thread1of1ForFork0_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][101], [Black: 194#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 197#true, 95#L726-1true, 219#(= |#race~x~0| 0), Black: 204#(= |thr2Thread1of1ForFork1_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 67#L703true, Black: 212#true, 175#true, 135#L710-1true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-03-17 10:43:08,878 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-03-17 10:43:08,878 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,878 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,878 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L710-->L709: Formula: (= v_~turn~0_5 1) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5} AuxVars[] AssignedVars[][140], [113#L703-3true, Black: 194#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 197#true, 102#L709true, 95#L726-1true, 219#(= |#race~x~0| 0), Black: 204#(= |thr2Thread1of1ForFork1_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 179#true, Black: 212#true, 175#true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-03-17 10:43:08,886 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-03-17 10:43:08,886 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,886 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,886 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-17 10:43:08,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L703-2-->L703: Formula: (= |v_#race~turn~0_12| |v_thr1Thread1of1ForFork0_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet5#1=|v_thr1Thread1of1ForFork0_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_12|, thr1Thread1of1ForFork0_#t~nondet5#1=|v_thr1Thread1of1ForFork0_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][101], [Black: 194#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 197#true, 95#L726-1true, 219#(= |#race~x~0| 0), Black: 204#(= |thr2Thread1of1ForFork1_#t~nondet7#1| |#race~flag2~0|), 57#L710true, 214#(= |#race~flag1~0| 0), Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 67#L703true, Black: 212#true, 175#true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-03-17 10:43:08,886 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-03-17 10:43:08,886 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-03-17 10:43:08,886 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-03-17 10:43:08,886 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-03-17 10:43:08,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L704-2-->L704: Formula: (= |v_#race~flag1~0_6| |v_thr1Thread1of1ForFork0_#t~nondet6#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet6#1=|v_thr1Thread1of1ForFork0_#t~nondet6#1_3|} OutVars{#race~flag1~0=|v_#race~flag1~0_6|, thr1Thread1of1ForFork0_#t~nondet6#1=|v_thr1Thread1of1ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~flag1~0][147], [Black: 194#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 122#L704true, Black: 197#true, 95#L726-1true, 219#(= |#race~x~0| 0), Black: 204#(= |thr2Thread1of1ForFork1_#t~nondet7#1| |#race~flag2~0|), Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 140#L709-1true, Black: 181#(= |#race~turn~0| 0), Black: 214#(= |#race~flag1~0| 0), 175#true, 184#true, Black: 186#(= ~turn~0 0), 212#true]) [2025-03-17 10:43:08,888 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-03-17 10:43:08,888 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-03-17 10:43:08,888 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-03-17 10:43:08,888 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-03-17 10:43:08,961 INFO L124 PetriNetUnfolderBase]: 335/2658 cut-off events. [2025-03-17 10:43:08,961 INFO L125 PetriNetUnfolderBase]: For 322/347 co-relation queries the response was YES. [2025-03-17 10:43:08,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4053 conditions, 2658 events. 335/2658 cut-off events. For 322/347 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 26956 event pairs, 54 based on Foata normal form. 1/2228 useless extension candidates. Maximal degree in co-relation 3266. Up to 215 conditions per place. [2025-03-17 10:43:08,975 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 14 selfloop transitions, 7 changer transitions 0/183 dead transitions. [2025-03-17 10:43:08,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 183 transitions, 600 flow [2025-03-17 10:43:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:43:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:43:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2025-03-17 10:43:08,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243243243243243 [2025-03-17 10:43:08,977 INFO L175 Difference]: Start difference. First operand has 162 places, 175 transitions, 533 flow. Second operand 3 states and 513 transitions. [2025-03-17 10:43:08,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 183 transitions, 600 flow [2025-03-17 10:43:08,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 183 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:43:08,981 INFO L231 Difference]: Finished difference. Result has 164 places, 181 transitions, 585 flow [2025-03-17 10:43:08,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=585, PETRI_PLACES=164, PETRI_TRANSITIONS=181} [2025-03-17 10:43:08,982 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, -5 predicate places. [2025-03-17 10:43:08,982 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 181 transitions, 585 flow [2025-03-17 10:43:08,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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-17 10:43:08,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:08,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:43:08,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:43:08,983 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr2Err9ASSERT_VIOLATIONDATA_RACE, thr2Err8ASSERT_VIOLATIONDATA_RACE, thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-17 10:43:08,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1843548601, now seen corresponding path program 1 times [2025-03-17 10:43:08,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:08,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59559585] [2025-03-17 10:43:08,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:08,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:08,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:43:08,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:43:08,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:08,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:43:08,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:43:08,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:43:09,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:43:09,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:09,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:43:09,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:43:09,023 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:43:09,024 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 44 remaining) [2025-03-17 10:43:09,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2025-03-17 10:43:09,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2025-03-17 10:43:09,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2025-03-17 10:43:09,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2025-03-17 10:43:09,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2025-03-17 10:43:09,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2025-03-17 10:43:09,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2025-03-17 10:43:09,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2025-03-17 10:43:09,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2025-03-17 10:43:09,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 44 remaining) [2025-03-17 10:43:09,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2025-03-17 10:43:09,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2025-03-17 10:43:09,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2025-03-17 10:43:09,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2025-03-17 10:43:09,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2025-03-17 10:43:09,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2025-03-17 10:43:09,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:43:09,030 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:43:09,072 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 10:43:09,072 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 10:43:09,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 10:43:09 BasicIcfg [2025-03-17 10:43:09,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 10:43:09,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 10:43:09,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 10:43:09,080 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 10:43:09,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:43:06" (3/4) ... [2025-03-17 10:43:09,081 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 10:43:09,112 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 5. [2025-03-17 10:43:09,139 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 10:43:09,140 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 10:43:09,140 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 10:43:09,140 INFO L158 Benchmark]: Toolchain (without parser) took 2954.05ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 111.8MB in the beginning and 142.7MB in the end (delta: -30.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2025-03-17 10:43:09,140 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:43:09,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.56ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 92.6MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 10:43:09,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.10ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:43:09,141 INFO L158 Benchmark]: Boogie Preprocessor took 12.78ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 89.6MB in the end (delta: 893.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:43:09,141 INFO L158 Benchmark]: IcfgBuilder took 312.25ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 72.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 10:43:09,141 INFO L158 Benchmark]: TraceAbstraction took 2204.89ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 71.5MB in the beginning and 151.6MB in the end (delta: -80.1MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2025-03-17 10:43:09,141 INFO L158 Benchmark]: Witness Printer took 59.72ms. Allocated memory is still 184.5MB. Free memory was 151.6MB in the beginning and 142.7MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:43:09,142 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.56ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 92.6MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.10ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.78ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 89.6MB in the end (delta: 893.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 312.25ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 72.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2204.89ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 71.5MB in the beginning and 151.6MB in the end (delta: -80.1MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * Witness Printer took 59.72ms. Allocated memory is still 184.5MB. Free memory was 151.6MB in the beginning and 142.7MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L689] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L690] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L691] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L723] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L724] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L725] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, t1=-1, turn=0, x=0] [L693] 1 flag1 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L694] COND TRUE 1 flag2 >= 1 [L694] 1 flag2 >= 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L726] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, t1=-1, t2=0, turn=0, x=0] [L708] 2 flag2 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L694] 1 flag2 >= 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] Now there is a data race on ~flag2~0 between C: flag2 = 1 [708] and C: flag2 >= 1 [694] - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 292 locations, 321 edges, 44 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 246 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 47 mSDtfsCounter, 246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=585occurred in iteration=8, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 301 ConstructedInterpolants, 0 QuantifiedInterpolants, 331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-17 10:43:09,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)