./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-1_2-join.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/ldv-races/race-1_2-join.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 fd4c3d19582748238e9ca587d159d6e8fc23db581cd4de03be73dc785992e03f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:40:00,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:40:00,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:40:00,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:40:00,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:40:00,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:40:00,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:40:00,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:40:00,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:40:00,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:40:00,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:40:00,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:40:00,949 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:40:00,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:40:00,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:40:00,949 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:40:00,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:40:00,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:40:00,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:40:00,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:40:00,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:40:00,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:40:00,950 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:40:00,951 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:40:00,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:40:00,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:40:00,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:40:00,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:40:00,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:40:00,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:40:00,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:40:00,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:40:00,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:40:00,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:40:00,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:40:00,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:40:00,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:40:00,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:40:00,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:40:00,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:40:00,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:40:00,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:40:00,953 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 -> fd4c3d19582748238e9ca587d159d6e8fc23db581cd4de03be73dc785992e03f [2025-03-04 06:40:01,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:40:01,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:40:01,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:40:01,206 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:40:01,207 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:40:01,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-1_2-join.i [2025-03-04 06:40:02,383 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4880827f/5be89e2fe66748b9a2304f335d9fd2b3/FLAGc31845ec5 [2025-03-04 06:40:02,699 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:40:02,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-1_2-join.i [2025-03-04 06:40:02,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4880827f/5be89e2fe66748b9a2304f335d9fd2b3/FLAGc31845ec5 [2025-03-04 06:40:02,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4880827f/5be89e2fe66748b9a2304f335d9fd2b3 [2025-03-04 06:40:02,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:40:02,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:40:02,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:40:02,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:40:02,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:40:02,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:40:02" (1/1) ... [2025-03-04 06:40:02,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c73d713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:02, skipping insertion in model container [2025-03-04 06:40:02,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:40:02" (1/1) ... [2025-03-04 06:40:03,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:40:03,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:40:03,427 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:40:03,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:40:03,591 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:40:03,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:03 WrapperNode [2025-03-04 06:40:03,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:40:03,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:40:03,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:40:03,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:40:03,598 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:40:03" (1/1) ... [2025-03-04 06:40:03,621 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:40:03" (1/1) ... [2025-03-04 06:40:03,639 INFO L138 Inliner]: procedures = 483, calls = 31, calls flagged for inlining = 9, calls inlined = 12, statements flattened = 123 [2025-03-04 06:40:03,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:40:03,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:40:03,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:40:03,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:40:03,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:03" (1/1) ... [2025-03-04 06:40:03,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:03" (1/1) ... [2025-03-04 06:40:03,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:03" (1/1) ... [2025-03-04 06:40:03,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:03" (1/1) ... [2025-03-04 06:40:03,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:03" (1/1) ... [2025-03-04 06:40:03,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:03" (1/1) ... [2025-03-04 06:40:03,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:03" (1/1) ... [2025-03-04 06:40:03,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:03" (1/1) ... [2025-03-04 06:40:03,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:40:03,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:40:03,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:40:03,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:40:03,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:03" (1/1) ... [2025-03-04 06:40:03,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:40:03,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:40:03,702 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:40:03,706 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:40:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:40:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:40:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:40:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:40:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:40:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:40:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:40:03,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:40:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:40:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:40:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:40:03,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:40:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:40:03,722 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:40:03,955 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:40:03,957 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:40:04,163 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:40:04,163 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:40:04,214 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:40:04,215 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:40:04,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:40:04 BoogieIcfgContainer [2025-03-04 06:40:04,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:40:04,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:40:04,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:40:04,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:40:04,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:40:02" (1/3) ... [2025-03-04 06:40:04,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5976583e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:40:04, skipping insertion in model container [2025-03-04 06:40:04,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:03" (2/3) ... [2025-03-04 06:40:04,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5976583e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:40:04, skipping insertion in model container [2025-03-04 06:40:04,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:40:04" (3/3) ... [2025-03-04 06:40:04,227 INFO L128 eAbstractionObserver]: Analyzing ICFG race-1_2-join.i [2025-03-04 06:40:04,262 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:40:04,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-1_2-join.i that has 2 procedures, 134 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-03-04 06:40:04,266 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:40:04,305 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:40:04,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 141 transitions, 289 flow [2025-03-04 06:40:04,406 INFO L124 PetriNetUnfolderBase]: 7/156 cut-off events. [2025-03-04 06:40:04,409 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:40:04,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 156 events. 7/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 243 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 94. Up to 3 conditions per place. [2025-03-04 06:40:04,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 141 transitions, 289 flow [2025-03-04 06:40:04,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 123 transitions, 252 flow [2025-03-04 06:40:04,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:40:04,432 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;@31032983, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:40:04,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 06:40:04,438 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:40:04,438 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-04 06:40:04,438 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:04,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:04,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:04,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:40:04,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash -489443369, now seen corresponding path program 1 times [2025-03-04 06:40:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:04,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821914506] [2025-03-04 06:40:04,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:04,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:04,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 06:40:04,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 06:40:04,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:04,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:04,750 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:40:04,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821914506] [2025-03-04 06:40:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821914506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:04,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:04,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469472900] [2025-03-04 06:40:04,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:04,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:04,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:04,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:04,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:04,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2025-03-04 06:40:04,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:40:04,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:04,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2025-03-04 06:40:04,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:04,909 INFO L124 PetriNetUnfolderBase]: 9/197 cut-off events. [2025-03-04 06:40:04,910 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:40:04,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 197 events. 9/197 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 603 event pairs, 9 based on Foata normal form. 4/182 useless extension candidates. Maximal degree in co-relation 124. Up to 36 conditions per place. [2025-03-04 06:40:04,913 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 16 selfloop transitions, 2 changer transitions 6/111 dead transitions. [2025-03-04 06:40:04,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 111 transitions, 264 flow [2025-03-04 06:40:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-03-04 06:40:04,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416075650118203 [2025-03-04 06:40:04,927 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 252 flow. Second operand 3 states and 356 transitions. [2025-03-04 06:40:04,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 111 transitions, 264 flow [2025-03-04 06:40:04,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:04,938 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 216 flow [2025-03-04 06:40:04,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2025-03-04 06:40:04,943 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -8 predicate places. [2025-03-04 06:40:04,946 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 216 flow [2025-03-04 06:40:04,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:40:04,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:04,946 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] [2025-03-04 06:40:04,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:40:04,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:40:04,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:04,948 INFO L85 PathProgramCache]: Analyzing trace with hash 406877220, now seen corresponding path program 1 times [2025-03-04 06:40:04,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:04,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769156768] [2025-03-04 06:40:04,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:04,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 06:40:04,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 06:40:04,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:04,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:05,036 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:40:05,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:05,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769156768] [2025-03-04 06:40:05,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769156768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:05,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:05,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213823904] [2025-03-04 06:40:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:05,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:05,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:05,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:05,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:05,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2025-03-04 06:40:05,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:40:05,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:05,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2025-03-04 06:40:05,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:05,111 INFO L124 PetriNetUnfolderBase]: 6/175 cut-off events. [2025-03-04 06:40:05,112 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-03-04 06:40:05,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 175 events. 6/175 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 462 event pairs, 2 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 180. Up to 17 conditions per place. [2025-03-04 06:40:05,113 INFO L140 encePairwiseOnDemand]: 130/141 looper letters, 13 selfloop transitions, 7 changer transitions 3/108 dead transitions. [2025-03-04 06:40:05,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 108 transitions, 265 flow [2025-03-04 06:40:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2025-03-04 06:40:05,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8368794326241135 [2025-03-04 06:40:05,115 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 216 flow. Second operand 3 states and 354 transitions. [2025-03-04 06:40:05,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 108 transitions, 265 flow [2025-03-04 06:40:05,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 108 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:05,118 INFO L231 Difference]: Finished difference. Result has 106 places, 102 transitions, 233 flow [2025-03-04 06:40:05,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=106, PETRI_TRANSITIONS=102} [2025-03-04 06:40:05,118 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2025-03-04 06:40:05,119 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 102 transitions, 233 flow [2025-03-04 06:40:05,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:40:05,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:05,119 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] [2025-03-04 06:40:05,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:40:05,119 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:40:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1239593422, now seen corresponding path program 1 times [2025-03-04 06:40:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:05,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329442228] [2025-03-04 06:40:05,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:05,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 06:40:05,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 06:40:05,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:05,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:05,252 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:40:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329442228] [2025-03-04 06:40:05,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329442228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:05,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:05,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:05,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064289702] [2025-03-04 06:40:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:05,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:05,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:05,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:05,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:05,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2025-03-04 06:40:05,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 102 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:40:05,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:05,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2025-03-04 06:40:05,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:05,341 INFO L124 PetriNetUnfolderBase]: 10/197 cut-off events. [2025-03-04 06:40:05,341 INFO L125 PetriNetUnfolderBase]: For 17/19 co-relation queries the response was YES. [2025-03-04 06:40:05,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 197 events. 10/197 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 656 event pairs, 8 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 23. Up to 41 conditions per place. [2025-03-04 06:40:05,342 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 18 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-04 06:40:05,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 271 flow [2025-03-04 06:40:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2025-03-04 06:40:05,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8226950354609929 [2025-03-04 06:40:05,344 INFO L175 Difference]: Start difference. First operand has 106 places, 102 transitions, 233 flow. Second operand 3 states and 348 transitions. [2025-03-04 06:40:05,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 271 flow [2025-03-04 06:40:05,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 101 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:05,346 INFO L231 Difference]: Finished difference. Result has 103 places, 101 transitions, 228 flow [2025-03-04 06:40:05,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=103, PETRI_TRANSITIONS=101} [2025-03-04 06:40:05,347 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -19 predicate places. [2025-03-04 06:40:05,348 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 101 transitions, 228 flow [2025-03-04 06:40:05,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:40:05,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:05,348 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:40:05,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:40:05,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:40:05,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:05,349 INFO L85 PathProgramCache]: Analyzing trace with hash 996399247, now seen corresponding path program 1 times [2025-03-04 06:40:05,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:05,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837522123] [2025-03-04 06:40:05,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:05,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:05,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:40:05,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:40:05,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:05,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:05,441 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:40:05,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:05,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837522123] [2025-03-04 06:40:05,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837522123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:05,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:05,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:05,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033112871] [2025-03-04 06:40:05,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:05,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:05,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:05,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:05,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:05,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2025-03-04 06:40:05,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 101 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:40:05,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:05,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2025-03-04 06:40:05,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:05,506 INFO L124 PetriNetUnfolderBase]: 17/213 cut-off events. [2025-03-04 06:40:05,506 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 06:40:05,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 213 events. 17/213 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 718 event pairs, 4 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 255. Up to 49 conditions per place. [2025-03-04 06:40:05,508 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 17 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2025-03-04 06:40:05,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 103 transitions, 272 flow [2025-03-04 06:40:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2025-03-04 06:40:05,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.851063829787234 [2025-03-04 06:40:05,510 INFO L175 Difference]: Start difference. First operand has 103 places, 101 transitions, 228 flow. Second operand 3 states and 360 transitions. [2025-03-04 06:40:05,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 103 transitions, 272 flow [2025-03-04 06:40:05,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 103 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:05,514 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 226 flow [2025-03-04 06:40:05,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2025-03-04 06:40:05,515 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -20 predicate places. [2025-03-04 06:40:05,515 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 226 flow [2025-03-04 06:40:05,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:40:05,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:05,516 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:40:05,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:40:05,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:40:05,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash -461099245, now seen corresponding path program 1 times [2025-03-04 06:40:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:05,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473924694] [2025-03-04 06:40:05,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:05,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:05,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:40:05,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:40:05,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:05,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:05,629 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:40:05,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:05,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473924694] [2025-03-04 06:40:05,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473924694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:05,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:05,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:05,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542167873] [2025-03-04 06:40:05,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:05,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:05,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:05,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:05,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:05,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 141 [2025-03-04 06:40:05,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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:40:05,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:05,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 141 [2025-03-04 06:40:05,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:05,676 INFO L124 PetriNetUnfolderBase]: 14/194 cut-off events. [2025-03-04 06:40:05,676 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 06:40:05,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 194 events. 14/194 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 598 event pairs, 4 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 172. Up to 24 conditions per place. [2025-03-04 06:40:05,680 INFO L140 encePairwiseOnDemand]: 139/141 looper letters, 14 selfloop transitions, 1 changer transitions 16/102 dead transitions. [2025-03-04 06:40:05,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 102 transitions, 262 flow [2025-03-04 06:40:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-03-04 06:40:05,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8699763593380615 [2025-03-04 06:40:05,682 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 226 flow. Second operand 3 states and 368 transitions. [2025-03-04 06:40:05,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 102 transitions, 262 flow [2025-03-04 06:40:05,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:05,686 INFO L231 Difference]: Finished difference. Result has 101 places, 83 transitions, 186 flow [2025-03-04 06:40:05,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=101, PETRI_TRANSITIONS=83} [2025-03-04 06:40:05,686 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -21 predicate places. [2025-03-04 06:40:05,686 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 83 transitions, 186 flow [2025-03-04 06:40:05,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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:40:05,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:05,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:05,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:40:05,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:40:05,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:05,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1670610420, now seen corresponding path program 1 times [2025-03-04 06:40:05,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:05,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734526835] [2025-03-04 06:40:05,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:05,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:05,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 06:40:05,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 06:40:05,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:05,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:05,822 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:40:05,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:05,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734526835] [2025-03-04 06:40:05,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734526835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:05,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:05,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:05,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93399049] [2025-03-04 06:40:05,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:05,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:05,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:05,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:05,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:05,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2025-03-04 06:40:05,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 83 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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:40:05,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:05,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2025-03-04 06:40:05,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:05,881 INFO L124 PetriNetUnfolderBase]: 10/159 cut-off events. [2025-03-04 06:40:05,881 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 06:40:05,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 159 events. 10/159 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 429 event pairs, 8 based on Foata normal form. 1/153 useless extension candidates. Maximal degree in co-relation 184. Up to 36 conditions per place. [2025-03-04 06:40:05,881 INFO L140 encePairwiseOnDemand]: 139/141 looper letters, 0 selfloop transitions, 0 changer transitions 82/82 dead transitions. [2025-03-04 06:40:05,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 82 transitions, 214 flow [2025-03-04 06:40:05,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2025-03-04 06:40:05,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8108747044917257 [2025-03-04 06:40:05,885 INFO L175 Difference]: Start difference. First operand has 101 places, 83 transitions, 186 flow. Second operand 3 states and 343 transitions. [2025-03-04 06:40:05,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 82 transitions, 214 flow [2025-03-04 06:40:05,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:05,886 INFO L231 Difference]: Finished difference. Result has 86 places, 0 transitions, 0 flow [2025-03-04 06:40:05,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=86, PETRI_TRANSITIONS=0} [2025-03-04 06:40:05,887 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -36 predicate places. [2025-03-04 06:40:05,887 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 0 transitions, 0 flow [2025-03-04 06:40:05,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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:40:05,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2025-03-04 06:40:05,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-04 06:40:05,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-04 06:40:05,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-04 06:40:05,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-04 06:40:05,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-04 06:40:05,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-04 06:40:05,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-04 06:40:05,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-04 06:40:05,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-04 06:40:05,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-04 06:40:05,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2025-03-04 06:40:05,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-04 06:40:05,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:40:05,895 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 06:40:05,900 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:40:05,901 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:40:05,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:40:05 BasicIcfg [2025-03-04 06:40:05,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:40:05,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:40:05,908 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:40:05,908 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:40:05,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:40:04" (3/4) ... [2025-03-04 06:40:05,910 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:40:05,912 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:40:05,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-04 06:40:05,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 06:40:05,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:40:05,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:40:05,994 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:40:05,995 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:40:05,995 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:40:05,997 INFO L158 Benchmark]: Toolchain (without parser) took 3036.88ms. Allocated memory is still 167.8MB. Free memory was 124.8MB in the beginning and 99.9MB in the end (delta: 24.9MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2025-03-04 06:40:05,997 INFO L158 Benchmark]: CDTParser took 1.49ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:40:05,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.08ms. Allocated memory is still 167.8MB. Free memory was 124.8MB in the beginning and 69.9MB in the end (delta: 54.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 06:40:05,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.72ms. Allocated memory is still 167.8MB. Free memory was 69.9MB in the beginning and 67.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:40:05,998 INFO L158 Benchmark]: Boogie Preprocessor took 24.68ms. Allocated memory is still 167.8MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:40:06,000 INFO L158 Benchmark]: IcfgBuilder took 549.78ms. Allocated memory is still 167.8MB. Free memory was 64.9MB in the beginning and 39.9MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:40:06,000 INFO L158 Benchmark]: TraceAbstraction took 1688.97ms. Allocated memory is still 167.8MB. Free memory was 39.5MB in the beginning and 106.8MB in the end (delta: -67.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:40:06,000 INFO L158 Benchmark]: Witness Printer took 87.96ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 99.9MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:40:06,001 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 632.08ms. Allocated memory is still 167.8MB. Free memory was 124.8MB in the beginning and 69.9MB in the end (delta: 54.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.72ms. Allocated memory is still 167.8MB. Free memory was 69.9MB in the beginning and 67.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.68ms. Allocated memory is still 167.8MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 549.78ms. Allocated memory is still 167.8MB. Free memory was 64.9MB in the beginning and 39.9MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1688.97ms. Allocated memory is still 167.8MB. Free memory was 39.5MB in the beginning and 106.8MB in the end (delta: -67.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 87.96ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 99.9MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1721]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1722]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1714]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1717]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1728]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1730]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1731]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 145 locations, 13 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.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 246 IncrementalHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 75 mSDtfsCounter, 246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=0, InterpolantAutomatonStates: 18, 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.5s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:40:06,018 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 Result: TRUE