./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/fkp2013_variant-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/fkp2013_variant-1.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 6f1a33edf94ce8e584ad249b95ad5bb2102c6ab4d820eebd8874b39ecbf22785 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:39:46,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:39:46,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:39:46,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:39:46,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:39:46,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:39:46,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:39:46,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:39:46,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:39:46,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:39:46,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:39:46,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:39:46,862 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:39:46,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:39:46,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:39:46,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:39:46,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:39:46,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:39:46,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:39:46,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:39:46,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:39:46,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:39:46,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:39:46,864 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:39:46,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:39:46,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:39:46,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:39:46,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:39:46,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:39:46,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:39:46,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:39:46,864 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 -> 6f1a33edf94ce8e584ad249b95ad5bb2102c6ab4d820eebd8874b39ecbf22785 [2025-03-04 06:39:47,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:39:47,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:39:47,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:39:47,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:39:47,284 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:39:47,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/fkp2013_variant-1.i [2025-03-04 06:39:48,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054053923/dcce761c1420440abdaec6b3615856df/FLAG976ed7b4c [2025-03-04 06:39:48,650 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:39:48,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/fkp2013_variant-1.i [2025-03-04 06:39:48,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054053923/dcce761c1420440abdaec6b3615856df/FLAG976ed7b4c [2025-03-04 06:39:48,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054053923/dcce761c1420440abdaec6b3615856df [2025-03-04 06:39:48,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:39:48,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:39:48,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:39:48,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:39:48,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:39:48,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:39:48" (1/1) ... [2025-03-04 06:39:48,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d6b9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:48, skipping insertion in model container [2025-03-04 06:39:48,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:39:48" (1/1) ... [2025-03-04 06:39:48,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:39:49,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:39:49,238 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:39:49,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:39:49,302 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:39:49,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49 WrapperNode [2025-03-04 06:39:49,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:39:49,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:39:49,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:39:49,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:39:49,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (1/1) ... [2025-03-04 06:39:49,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (1/1) ... [2025-03-04 06:39:49,343 INFO L138 Inliner]: procedures = 171, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2025-03-04 06:39:49,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:39:49,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:39:49,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:39:49,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:39:49,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (1/1) ... [2025-03-04 06:39:49,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (1/1) ... [2025-03-04 06:39:49,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (1/1) ... [2025-03-04 06:39:49,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (1/1) ... [2025-03-04 06:39:49,358 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (1/1) ... [2025-03-04 06:39:49,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (1/1) ... [2025-03-04 06:39:49,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (1/1) ... [2025-03-04 06:39:49,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (1/1) ... [2025-03-04 06:39:49,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:39:49,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:39:49,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:39:49,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:39:49,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (1/1) ... [2025-03-04 06:39:49,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:39:49,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:39:49,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:39:49,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:39:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-04 06:39:49,415 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-04 06:39:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 06:39:49,415 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 06:39:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:39:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:39:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:39:49,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:39:49,416 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:39:49,502 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:39:49,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:39:49,625 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:39:49,625 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:39:49,636 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:39:49,636 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:39:49,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:39:49 BoogieIcfgContainer [2025-03-04 06:39:49,637 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:39:49,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:39:49,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:39:49,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:39:49,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:39:48" (1/3) ... [2025-03-04 06:39:49,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290cc896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:39:49, skipping insertion in model container [2025-03-04 06:39:49,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:49" (2/3) ... [2025-03-04 06:39:49,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290cc896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:39:49, skipping insertion in model container [2025-03-04 06:39:49,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:39:49" (3/3) ... [2025-03-04 06:39:49,646 INFO L128 eAbstractionObserver]: Analyzing ICFG fkp2013_variant-1.i [2025-03-04 06:39:49,657 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:39:49,658 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fkp2013_variant-1.i that has 3 procedures, 102 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-03-04 06:39:49,658 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:39:49,701 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:39:49,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 106 transitions, 220 flow [2025-03-04 06:39:49,777 INFO L124 PetriNetUnfolderBase]: 5/119 cut-off events. [2025-03-04 06:39:49,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:39:49,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 119 events. 5/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 183 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2025-03-04 06:39:49,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 106 transitions, 220 flow [2025-03-04 06:39:49,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 105 transitions, 217 flow [2025-03-04 06:39:49,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:39:49,811 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;@3f781aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:39:49,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 06:39:49,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:39:49,824 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-03-04 06:39:49,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:39:49,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:39:49,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:39:49,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:39:49,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:39:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1341372660, now seen corresponding path program 1 times [2025-03-04 06:39:49,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:39:49,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839857116] [2025-03-04 06:39:49,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:39:49,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:39:49,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 06:39:49,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 06:39:49,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:39:49,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:39:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:39:49,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:39:49,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839857116] [2025-03-04 06:39:49,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839857116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:39:49,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:39:49,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:39:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51233870] [2025-03-04 06:39:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:39:49,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:39:49,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:39:50,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:39:50,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:39:50,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 106 [2025-03-04 06:39:50,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:39:50,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:39:50,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 106 [2025-03-04 06:39:50,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:39:50,121 INFO L124 PetriNetUnfolderBase]: 11/231 cut-off events. [2025-03-04 06:39:50,121 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:39:50,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 231 events. 11/231 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 835 event pairs, 11 based on Foata normal form. 18/209 useless extension candidates. Maximal degree in co-relation 218. Up to 31 conditions per place. [2025-03-04 06:39:50,124 INFO L140 encePairwiseOnDemand]: 99/106 looper letters, 9 selfloop transitions, 2 changer transitions 1/98 dead transitions. [2025-03-04 06:39:50,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 98 transitions, 225 flow [2025-03-04 06:39:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:39:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:39:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2025-03-04 06:39:50,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.889937106918239 [2025-03-04 06:39:50,134 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 217 flow. Second operand 3 states and 283 transitions. [2025-03-04 06:39:50,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 98 transitions, 225 flow [2025-03-04 06:39:50,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 98 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:39:50,143 INFO L231 Difference]: Finished difference. Result has 105 places, 97 transitions, 204 flow [2025-03-04 06:39:50,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=105, PETRI_TRANSITIONS=97} [2025-03-04 06:39:50,147 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -2 predicate places. [2025-03-04 06:39:50,147 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 97 transitions, 204 flow [2025-03-04 06:39:50,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:39:50,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:39:50,148 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] [2025-03-04 06:39:50,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:39:50,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:39:50,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:39:50,149 INFO L85 PathProgramCache]: Analyzing trace with hash -660398745, now seen corresponding path program 1 times [2025-03-04 06:39:50,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:39:50,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034346212] [2025-03-04 06:39:50,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:39:50,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:39:50,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 06:39:50,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 06:39:50,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:39:50,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:39:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:39:50,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:39:50,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034346212] [2025-03-04 06:39:50,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034346212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:39:50,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:39:50,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:39:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455727832] [2025-03-04 06:39:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:39:50,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:39:50,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:39:50,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:39:50,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:39:50,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 106 [2025-03-04 06:39:50,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:39:50,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:39:50,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 106 [2025-03-04 06:39:50,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:39:50,231 INFO L124 PetriNetUnfolderBase]: 5/161 cut-off events. [2025-03-04 06:39:50,232 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:39:50,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 161 events. 5/161 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 455 event pairs, 5 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 169. Up to 22 conditions per place. [2025-03-04 06:39:50,233 INFO L140 encePairwiseOnDemand]: 103/106 looper letters, 9 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-03-04 06:39:50,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 96 transitions, 224 flow [2025-03-04 06:39:50,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:39:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:39:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-03-04 06:39:50,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8773584905660378 [2025-03-04 06:39:50,235 INFO L175 Difference]: Start difference. First operand has 105 places, 97 transitions, 204 flow. Second operand 3 states and 279 transitions. [2025-03-04 06:39:50,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 96 transitions, 224 flow [2025-03-04 06:39:50,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 96 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:39:50,237 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 202 flow [2025-03-04 06:39:50,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2025-03-04 06:39:50,237 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -4 predicate places. [2025-03-04 06:39:50,238 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 202 flow [2025-03-04 06:39:50,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:39:50,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:39:50,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:39:50,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:39:50,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:39:50,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:39:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1839334977, now seen corresponding path program 1 times [2025-03-04 06:39:50,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:39:50,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667521024] [2025-03-04 06:39:50,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:39:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:39:50,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 06:39:50,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 06:39:50,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:39:50,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:39:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:39:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:39:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667521024] [2025-03-04 06:39:50,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667521024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:39:50,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:39:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:39:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189172862] [2025-03-04 06:39:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:39:50,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:39:50,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:39:50,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:39:50,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:39:50,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 106 [2025-03-04 06:39:50,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:39:50,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:39:50,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 106 [2025-03-04 06:39:50,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:39:50,348 INFO L124 PetriNetUnfolderBase]: 10/216 cut-off events. [2025-03-04 06:39:50,349 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:39:50,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 216 events. 10/216 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 822 event pairs, 10 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 226. Up to 30 conditions per place. [2025-03-04 06:39:50,350 INFO L140 encePairwiseOnDemand]: 102/106 looper letters, 8 selfloop transitions, 1 changer transitions 0/93 dead transitions. [2025-03-04 06:39:50,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 93 transitions, 214 flow [2025-03-04 06:39:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:39:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:39:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-03-04 06:39:50,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8773584905660378 [2025-03-04 06:39:50,352 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 202 flow. Second operand 3 states and 279 transitions. [2025-03-04 06:39:50,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 93 transitions, 214 flow [2025-03-04 06:39:50,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 93 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:39:50,354 INFO L231 Difference]: Finished difference. Result has 100 places, 93 transitions, 194 flow [2025-03-04 06:39:50,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=100, PETRI_TRANSITIONS=93} [2025-03-04 06:39:50,357 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -7 predicate places. [2025-03-04 06:39:50,357 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 194 flow [2025-03-04 06:39:50,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:39:50,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:39:50,359 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-04 06:39:50,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:39:50,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:39:50,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:39:50,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1035202, now seen corresponding path program 1 times [2025-03-04 06:39:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:39:50,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380550728] [2025-03-04 06:39:50,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:39:50,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:39:50,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:39:50,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:39:50,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:39:50,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:39:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:39:50,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:39:50,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380550728] [2025-03-04 06:39:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380550728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:39:50,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:39:50,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:39:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279769946] [2025-03-04 06:39:50,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:39:50,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:39:50,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:39:50,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:39:50,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:39:50,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 106 [2025-03-04 06:39:50,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:39:50,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:39:50,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 106 [2025-03-04 06:39:50,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:39:50,489 INFO L124 PetriNetUnfolderBase]: 7/176 cut-off events. [2025-03-04 06:39:50,490 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:39:50,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 176 events. 7/176 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 518 event pairs, 2 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 180. Up to 19 conditions per place. [2025-03-04 06:39:50,493 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 9 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2025-03-04 06:39:50,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 229 flow [2025-03-04 06:39:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:39:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:39:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2025-03-04 06:39:50,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9056603773584906 [2025-03-04 06:39:50,494 INFO L175 Difference]: Start difference. First operand has 100 places, 93 transitions, 194 flow. Second operand 3 states and 288 transitions. [2025-03-04 06:39:50,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 229 flow [2025-03-04 06:39:50,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 96 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:39:50,498 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 221 flow [2025-03-04 06:39:50,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2025-03-04 06:39:50,499 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -5 predicate places. [2025-03-04 06:39:50,500 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 221 flow [2025-03-04 06:39:50,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:39:50,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:39:50,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:39:50,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:39:50,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:39:50,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:39:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1979387378, now seen corresponding path program 1 times [2025-03-04 06:39:50,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:39:50,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409070195] [2025-03-04 06:39:50,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:39:50,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:39:50,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:39:50,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:39:50,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:39:50,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:39:50,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:39:50,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:39:50,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409070195] [2025-03-04 06:39:50,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409070195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:39:50,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:39:50,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:39:50,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113940874] [2025-03-04 06:39:50,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:39:50,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:39:50,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:39:50,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:39:50,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:39:50,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 106 [2025-03-04 06:39:50,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:39:50,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:39:50,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 106 [2025-03-04 06:39:50,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:39:50,626 INFO L124 PetriNetUnfolderBase]: 6/214 cut-off events. [2025-03-04 06:39:50,626 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2025-03-04 06:39:50,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 214 events. 6/214 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 743 event pairs, 2 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 250. Up to 23 conditions per place. [2025-03-04 06:39:50,629 INFO L140 encePairwiseOnDemand]: 101/106 looper letters, 11 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2025-03-04 06:39:50,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 98 transitions, 261 flow [2025-03-04 06:39:50,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:39:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:39:50,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-03-04 06:39:50,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9025157232704403 [2025-03-04 06:39:50,631 INFO L175 Difference]: Start difference. First operand has 102 places, 95 transitions, 221 flow. Second operand 3 states and 287 transitions. [2025-03-04 06:39:50,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 98 transitions, 261 flow [2025-03-04 06:39:50,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 98 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:39:50,636 INFO L231 Difference]: Finished difference. Result has 104 places, 98 transitions, 245 flow [2025-03-04 06:39:50,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=104, PETRI_TRANSITIONS=98} [2025-03-04 06:39:50,636 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2025-03-04 06:39:50,637 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 98 transitions, 245 flow [2025-03-04 06:39:50,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:39:50,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:39:50,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:39:50,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:39:50,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:39:50,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:39:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash 289694872, now seen corresponding path program 1 times [2025-03-04 06:39:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:39:50,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450772322] [2025-03-04 06:39:50,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:39:50,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:39:50,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:39:50,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:39:50,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:39:50,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:39:50,662 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:39:50,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:39:50,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:39:50,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:39:50,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:39:50,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:39:50,718 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:39:50,719 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-03-04 06:39:50,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-04 06:39:50,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-04 06:39:50,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-04 06:39:50,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-04 06:39:50,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-04 06:39:50,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-04 06:39:50,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-04 06:39:50,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-04 06:39:50,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2025-03-04 06:39:50,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 14 remaining) [2025-03-04 06:39:50,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-04 06:39:50,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-04 06:39:50,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-04 06:39:50,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:39:50,723 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 06:39:50,772 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:39:50,772 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:39:50,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:39:50 BasicIcfg [2025-03-04 06:39:50,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:39:50,777 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:39:50,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:39:50,780 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:39:50,781 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:39:49" (3/4) ... [2025-03-04 06:39:50,781 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 06:39:50,830 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-03-04 06:39:50,866 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:39:50,866 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:39:50,867 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:39:50,867 INFO L158 Benchmark]: Toolchain (without parser) took 1917.64ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 89.8MB in the end (delta: 14.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2025-03-04 06:39:50,868 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:39:50,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.76ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 84.7MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:39:50,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.96ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 83.6MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:39:50,868 INFO L158 Benchmark]: Boogie Preprocessor took 23.97ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 82.7MB in the end (delta: 924.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:39:50,868 INFO L158 Benchmark]: IcfgBuilder took 267.73ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 68.0MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:39:50,868 INFO L158 Benchmark]: TraceAbstraction took 1137.39ms. Allocated memory is still 142.6MB. Free memory was 66.9MB in the beginning and 100.4MB in the end (delta: -33.5MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2025-03-04 06:39:50,868 INFO L158 Benchmark]: Witness Printer took 89.28ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 89.8MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:39:50,869 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.14ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.76ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 84.7MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.96ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 83.6MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.97ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 82.7MB in the end (delta: 924.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 267.73ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 68.0MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1137.39ms. Allocated memory is still 142.6MB. Free memory was 66.9MB in the beginning and 100.4MB in the end (delta: -33.5MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Witness Printer took 89.28ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 89.8MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 700]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int x; VAL [x=0] [L698] 0 volatile int n; VAL [n=0, x=0] [L710] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={53:50}, argc=52, n=0, x=0] [L711] 0 int i; VAL [\old(argc)=52, \old(argv)={53:50}, argc=52, n=0, x=0] [L712] 0 x = 0 VAL [\old(argc)=52, \old(argv)={53:50}, argc=52, n=0, x=0] [L713] 0 n = __VERIFIER_nondet_int() VAL [\old(argc)=52, \old(argv)={53:50}, argc=52, n=1, x=0] [L714] EXPR 0 n > 0 VAL [\old(argc)=52, \old(argv)={53:50}, argc=52, n=1, x=0] [L714] CALL 0 assume_abort_if_not(n > 0) [L686] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, n=1, x=0] [L714] RET 0 assume_abort_if_not(n > 0) [L715] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={53:50}, argc=52, n=1, t1=-1, x=0] [L716] 0 i = 0 VAL [\old(argc)=52, \old(argv)={53:50}, argc=52, i=0, n=1, t1=-1, x=0] [L716] COND TRUE 0 i < n [L716] 0 i < n VAL [\old(argc)=52, \old(argv)={53:50}, argc=52, i=0, n=1, t1=-1, x=0] [L716] COND TRUE 0 i < n VAL [\old(argc)=52, \old(argv)={53:50}, argc=52, i=0, n=1, t1=-1, x=0] [L717] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(arg)={0:0}, \old(argc)=52, \old(argv)={53:50}, argc=52, i=0, n=1, t1=-1, t2=0, x=0] [L704] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, n=1, x=0] [L700] 1 x <= n VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, n=1, x=0] [L705] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, n=1, t=0, x=0] [L706] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, n=1, t=0, x=1] [L700] 1 x <= n VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, n=1, t=0, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [706] and C: x <= n [700] - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: 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: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: 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: 715]: 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: 717]: 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, 140 locations, 14 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: 1.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 20 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=5, InterpolantAutomatonStates: 15, 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.2s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-04 06:39:50,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)