./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race.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-race-challenges/thread-join-array-dynamic-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec72a571c515701a06aa24404f70bcf9f40028e7df85d67cfca81a233c8469ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:59:54,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:59:54,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:59:54,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:59:54,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:59:54,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:59:54,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:59:54,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:59:54,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:59:54,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:59:54,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:59:54,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:59:54,191 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:59:54,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:59:54,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:59:54,192 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:59:54,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:59:54,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:59:54,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:59:54,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:59:54,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:59:54,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:59:54,192 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:59:54,192 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:59:54,193 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:59:54,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:59:54,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:59:54,193 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 -> ec72a571c515701a06aa24404f70bcf9f40028e7df85d67cfca81a233c8469ca [2025-03-04 06:59:54,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:59:54,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:59:54,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:59:54,435 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:59:54,435 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:59:54,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race.i [2025-03-04 06:59:55,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a4b2a37/d25bede63ec245ed916fac2a1c33496e/FLAG51a857a69 [2025-03-04 06:59:55,860 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:59:55,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race.i [2025-03-04 06:59:55,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a4b2a37/d25bede63ec245ed916fac2a1c33496e/FLAG51a857a69 [2025-03-04 06:59:56,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a4b2a37/d25bede63ec245ed916fac2a1c33496e [2025-03-04 06:59:56,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:59:56,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:59:56,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:59:56,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:59:56,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:59:56,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:59:56" (1/1) ... [2025-03-04 06:59:56,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350ce49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56, skipping insertion in model container [2025-03-04 06:59:56,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:59:56" (1/1) ... [2025-03-04 06:59:56,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:59:56,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:59:56,465 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:59:56,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:59:56,545 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:59:56,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56 WrapperNode [2025-03-04 06:59:56,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:59:56,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:59:56,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:59:56,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:59:56,551 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:59:56" (1/1) ... [2025-03-04 06:59:56,564 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:59:56" (1/1) ... [2025-03-04 06:59:56,580 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2025-03-04 06:59:56,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:59:56,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:59:56,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:59:56,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:59:56,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56" (1/1) ... [2025-03-04 06:59:56,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56" (1/1) ... [2025-03-04 06:59:56,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56" (1/1) ... [2025-03-04 06:59:56,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56" (1/1) ... [2025-03-04 06:59:56,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56" (1/1) ... [2025-03-04 06:59:56,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56" (1/1) ... [2025-03-04 06:59:56,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56" (1/1) ... [2025-03-04 06:59:56,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56" (1/1) ... [2025-03-04 06:59:56,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:59:56,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:59:56,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:59:56,597 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:59:56,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56" (1/1) ... [2025-03-04 06:59:56,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:59:56,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:59:56,623 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:59:56,626 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:59:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:59:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:59:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:59:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:59:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:59:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:59:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:59:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:59:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 06:59:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 06:59:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:59:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:59:56,643 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:59:56,726 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:59:56,728 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:59:56,916 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:59:56,916 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:59:56,933 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:59:56,933 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:59:56,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:59:56 BoogieIcfgContainer [2025-03-04 06:59:56,934 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:59:56,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:59:56,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:59:56,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:59:56,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:59:56" (1/3) ... [2025-03-04 06:59:56,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:59:56, skipping insertion in model container [2025-03-04 06:59:56,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:56" (2/3) ... [2025-03-04 06:59:56,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:59:56, skipping insertion in model container [2025-03-04 06:59:56,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:59:56" (3/3) ... [2025-03-04 06:59:56,941 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race.i [2025-03-04 06:59:56,950 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:59:56,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-dynamic-race.i that has 2 procedures, 87 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-04 06:59:56,952 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:59:56,997 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:59:57,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 185 flow [2025-03-04 06:59:57,070 INFO L124 PetriNetUnfolderBase]: 2/121 cut-off events. [2025-03-04 06:59:57,073 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:59:57,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 121 events. 2/121 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 60. Up to 3 conditions per place. [2025-03-04 06:59:57,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 89 transitions, 185 flow [2025-03-04 06:59:57,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 89 transitions, 185 flow [2025-03-04 06:59:57,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:59:57,093 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;@6a482d54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:59:57,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 06:59:57,107 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:59:57,107 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-04 06:59:57,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:59:57,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:57,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:57,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:59:57,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash 579840394, now seen corresponding path program 1 times [2025-03-04 06:59:57,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:57,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032838806] [2025-03-04 06:59:57,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:57,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:57,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:59:57,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:59:57,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:57,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:57,322 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:59:57,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:57,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032838806] [2025-03-04 06:59:57,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032838806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:57,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:57,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264985505] [2025-03-04 06:59:57,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:57,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:57,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:57,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:57,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:57,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 89 [2025-03-04 06:59:57,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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:59:57,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:57,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 89 [2025-03-04 06:59:57,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:57,429 INFO L124 PetriNetUnfolderBase]: 8/163 cut-off events. [2025-03-04 06:59:57,431 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-03-04 06:59:57,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 163 events. 8/163 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 409 event pairs, 1 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2025-03-04 06:59:57,433 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 8 selfloop transitions, 3 changer transitions 2/92 dead transitions. [2025-03-04 06:59:57,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 215 flow [2025-03-04 06:59:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-03-04 06:59:57,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951310861423221 [2025-03-04 06:59:57,444 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 185 flow. Second operand 3 states and 254 transitions. [2025-03-04 06:59:57,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 215 flow [2025-03-04 06:59:57,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:57,450 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 203 flow [2025-03-04 06:59:57,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2025-03-04 06:59:57,454 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-03-04 06:59:57,454 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 203 flow [2025-03-04 06:59:57,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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:59:57,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:57,455 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] [2025-03-04 06:59:57,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:59:57,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:59:57,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:57,455 INFO L85 PathProgramCache]: Analyzing trace with hash 769112976, now seen corresponding path program 1 times [2025-03-04 06:59:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:57,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353465962] [2025-03-04 06:59:57,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:57,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:57,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 06:59:57,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 06:59:57,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:57,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:57,958 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:59:57,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353465962] [2025-03-04 06:59:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353465962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:57,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:57,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:57,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269289177] [2025-03-04 06:59:57,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:57,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:57,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:57,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:57,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:58,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2025-03-04 06:59:58,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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:59:58,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:58,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2025-03-04 06:59:58,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:58,165 INFO L124 PetriNetUnfolderBase]: 31/264 cut-off events. [2025-03-04 06:59:58,165 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 06:59:58,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 264 events. 31/264 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1171 event pairs, 11 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 299. Up to 62 conditions per place. [2025-03-04 06:59:58,167 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 24 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2025-03-04 06:59:58,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 275 flow [2025-03-04 06:59:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 426 transitions. [2025-03-04 06:59:58,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.797752808988764 [2025-03-04 06:59:58,172 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 203 flow. Second operand 6 states and 426 transitions. [2025-03-04 06:59:58,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 275 flow [2025-03-04 06:59:58,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:58,174 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 205 flow [2025-03-04 06:59:58,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2025-03-04 06:59:58,175 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-03-04 06:59:58,175 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 205 flow [2025-03-04 06:59:58,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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:59:58,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:58,175 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] [2025-03-04 06:59:58,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:59:58,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:59:58,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1703433976, now seen corresponding path program 1 times [2025-03-04 06:59:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:58,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3294568] [2025-03-04 06:59:58,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:58,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:58,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 06:59:58,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 06:59:58,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:58,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:58,243 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:59:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3294568] [2025-03-04 06:59:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3294568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:58,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:58,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:58,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125599290] [2025-03-04 06:59:58,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:58,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:59:58,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:58,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:59:58,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:59:58,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 89 [2025-03-04 06:59:58,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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:59:58,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:58,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 89 [2025-03-04 06:59:58,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:58,358 INFO L124 PetriNetUnfolderBase]: 17/232 cut-off events. [2025-03-04 06:59:58,358 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:59:58,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 232 events. 17/232 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 813 event pairs, 1 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2025-03-04 06:59:58,360 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 15 selfloop transitions, 2 changer transitions 5/95 dead transitions. [2025-03-04 06:59:58,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 263 flow [2025-03-04 06:59:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 461 transitions. [2025-03-04 06:59:58,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8632958801498127 [2025-03-04 06:59:58,362 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 205 flow. Second operand 6 states and 461 transitions. [2025-03-04 06:59:58,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 263 flow [2025-03-04 06:59:58,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 253 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:59:58,364 INFO L231 Difference]: Finished difference. Result has 99 places, 88 transitions, 213 flow [2025-03-04 06:59:58,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=88} [2025-03-04 06:59:58,364 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2025-03-04 06:59:58,366 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 88 transitions, 213 flow [2025-03-04 06:59:58,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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:59:58,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:58,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:58,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:59:58,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:59:58,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1742150653, now seen corresponding path program 1 times [2025-03-04 06:59:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:58,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539284758] [2025-03-04 06:59:58,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:58,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:58,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 06:59:58,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 06:59:58,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:58,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:58,417 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:59:58,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:58,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539284758] [2025-03-04 06:59:58,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539284758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:58,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:58,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:58,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661003697] [2025-03-04 06:59:58,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:58,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:58,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:58,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:58,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:58,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 89 [2025-03-04 06:59:58,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:59:58,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:58,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 89 [2025-03-04 06:59:58,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:58,454 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2025-03-04 06:59:58,454 INFO L125 PetriNetUnfolderBase]: For 13/25 co-relation queries the response was YES. [2025-03-04 06:59:58,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 169 events. 5/169 cut-off events. For 13/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 482 event pairs, 3 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 189. Up to 25 conditions per place. [2025-03-04 06:59:58,455 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 8 selfloop transitions, 4 changer transitions 3/91 dead transitions. [2025-03-04 06:59:58,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 249 flow [2025-03-04 06:59:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-03-04 06:59:58,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288389513108615 [2025-03-04 06:59:58,456 INFO L175 Difference]: Start difference. First operand has 99 places, 88 transitions, 213 flow. Second operand 3 states and 248 transitions. [2025-03-04 06:59:58,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 249 flow [2025-03-04 06:59:58,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 235 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 06:59:58,460 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 221 flow [2025-03-04 06:59:58,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2025-03-04 06:59:58,462 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-03-04 06:59:58,462 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 221 flow [2025-03-04 06:59:58,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:59:58,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:58,462 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] [2025-03-04 06:59:58,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:59:58,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:59:58,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1668930352, now seen corresponding path program 1 times [2025-03-04 06:59:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:58,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965530320] [2025-03-04 06:59:58,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:58,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:58,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 06:59:58,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 06:59:58,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:58,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:58,564 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:59:58,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965530320] [2025-03-04 06:59:58,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965530320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:58,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:58,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:59:58,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926885155] [2025-03-04 06:59:58,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:58,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:59:58,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:58,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:59:58,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:59:58,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 89 [2025-03-04 06:59:58,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 71.71428571428571) internal successors, (502), 7 states have internal predecessors, (502), 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:59:58,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:58,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 89 [2025-03-04 06:59:58,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:58,782 INFO L124 PetriNetUnfolderBase]: 19/193 cut-off events. [2025-03-04 06:59:58,782 INFO L125 PetriNetUnfolderBase]: For 22/26 co-relation queries the response was YES. [2025-03-04 06:59:58,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 193 events. 19/193 cut-off events. For 22/26 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 727 event pairs, 0 based on Foata normal form. 3/192 useless extension candidates. Maximal degree in co-relation 253. Up to 13 conditions per place. [2025-03-04 06:59:58,784 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 17 selfloop transitions, 9 changer transitions 4/90 dead transitions. [2025-03-04 06:59:58,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 282 flow [2025-03-04 06:59:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:59:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:59:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 661 transitions. [2025-03-04 06:59:58,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8252184769038702 [2025-03-04 06:59:58,786 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 221 flow. Second operand 9 states and 661 transitions. [2025-03-04 06:59:58,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 282 flow [2025-03-04 06:59:58,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:58,788 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 202 flow [2025-03-04 06:59:58,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2025-03-04 06:59:58,788 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -1 predicate places. [2025-03-04 06:59:58,791 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 202 flow [2025-03-04 06:59:58,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.71428571428571) internal successors, (502), 7 states have internal predecessors, (502), 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:59:58,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:58,792 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:58,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:59:58,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:59:58,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:58,794 INFO L85 PathProgramCache]: Analyzing trace with hash -463222286, now seen corresponding path program 1 times [2025-03-04 06:59:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:58,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880717709] [2025-03-04 06:59:58,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:58,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 06:59:58,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 06:59:58,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:58,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:59:58,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:59:58,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 06:59:58,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 06:59:58,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:58,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:59:58,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:59:58,854 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:59:58,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-04 06:59:58,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-03-04 06:59:58,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-03-04 06:59:58,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-03-04 06:59:58,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-03-04 06:59:58,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-03-04 06:59:58,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:59:58,857 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 06:59:58,858 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:59:58,859 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:59:58,880 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:59:58,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 107 transitions, 230 flow [2025-03-04 06:59:58,900 INFO L124 PetriNetUnfolderBase]: 4/205 cut-off events. [2025-03-04 06:59:58,900 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:59:58,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 205 events. 4/205 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 446 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 123. Up to 6 conditions per place. [2025-03-04 06:59:58,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 107 transitions, 230 flow [2025-03-04 06:59:58,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 107 transitions, 230 flow [2025-03-04 06:59:58,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:59:58,903 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;@6a482d54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:59:58,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 06:59:58,908 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:59:58,908 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-04 06:59:58,908 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:59:58,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:58,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:58,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-04 06:59:58,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1436929258, now seen corresponding path program 1 times [2025-03-04 06:59:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122939266] [2025-03-04 06:59:58,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:58,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:59:58,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:59:58,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:58,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:58,928 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:59:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122939266] [2025-03-04 06:59:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122939266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:58,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:58,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526469120] [2025-03-04 06:59:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:58,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:58,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:58,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:58,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:58,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2025-03-04 06:59:58,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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:59:58,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:58,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2025-03-04 06:59:58,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:59,023 INFO L124 PetriNetUnfolderBase]: 119/731 cut-off events. [2025-03-04 06:59:59,023 INFO L125 PetriNetUnfolderBase]: For 68/92 co-relation queries the response was YES. [2025-03-04 06:59:59,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 731 events. 119/731 cut-off events. For 68/92 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4288 event pairs, 50 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 749. Up to 139 conditions per place. [2025-03-04 06:59:59,027 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 16 selfloop transitions, 4 changer transitions 1/113 dead transitions. [2025-03-04 06:59:59,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 113 transitions, 282 flow [2025-03-04 06:59:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2025-03-04 06:59:59,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376947040498442 [2025-03-04 06:59:59,028 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 230 flow. Second operand 3 states and 301 transitions. [2025-03-04 06:59:59,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 113 transitions, 282 flow [2025-03-04 06:59:59,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:59,030 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 256 flow [2025-03-04 06:59:59,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2025-03-04 06:59:59,030 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places. [2025-03-04 06:59:59,030 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 256 flow [2025-03-04 06:59:59,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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:59:59,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:59,031 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] [2025-03-04 06:59:59,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:59:59,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-04 06:59:59,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash -202206128, now seen corresponding path program 1 times [2025-03-04 06:59:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:59,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562401806] [2025-03-04 06:59:59,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:59,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 06:59:59,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 06:59:59,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:59,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:59,217 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:59:59,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:59,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562401806] [2025-03-04 06:59:59,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562401806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:59,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:59,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:59,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995425872] [2025-03-04 06:59:59,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:59,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:59,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:59,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:59,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:59,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2025-03-04 06:59:59,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 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:59:59,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:59,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2025-03-04 06:59:59,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:59,471 INFO L124 PetriNetUnfolderBase]: 299/1296 cut-off events. [2025-03-04 06:59:59,473 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-04 06:59:59,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 1296 events. 299/1296 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9678 event pairs, 58 based on Foata normal form. 0/1172 useless extension candidates. Maximal degree in co-relation 1396. Up to 372 conditions per place. [2025-03-04 06:59:59,482 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 36 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-04 06:59:59,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 123 transitions, 368 flow [2025-03-04 06:59:59,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2025-03-04 06:59:59,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8130841121495327 [2025-03-04 06:59:59,485 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 256 flow. Second operand 6 states and 522 transitions. [2025-03-04 06:59:59,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 123 transitions, 368 flow [2025-03-04 06:59:59,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 123 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:59,489 INFO L231 Difference]: Finished difference. Result has 114 places, 107 transitions, 256 flow [2025-03-04 06:59:59,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=114, PETRI_TRANSITIONS=107} [2025-03-04 06:59:59,490 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 5 predicate places. [2025-03-04 06:59:59,490 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 107 transitions, 256 flow [2025-03-04 06:59:59,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 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:59:59,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:59,491 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] [2025-03-04 06:59:59,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:59:59,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-04 06:59:59,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1620214216, now seen corresponding path program 1 times [2025-03-04 06:59:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:59,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273822442] [2025-03-04 06:59:59,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:59,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:59,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 06:59:59,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 06:59:59,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:59,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:59,569 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:59:59,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:59,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273822442] [2025-03-04 06:59:59,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273822442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:59,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:59,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:59,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056100488] [2025-03-04 06:59:59,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:59,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:59:59,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:59,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:59:59,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:59:59,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 107 [2025-03-04 06:59:59,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 107 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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:59:59,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:59,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 107 [2025-03-04 06:59:59,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:59,782 INFO L124 PetriNetUnfolderBase]: 189/1190 cut-off events. [2025-03-04 06:59:59,783 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:59:59,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1190 events. 189/1190 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8555 event pairs, 131 based on Foata normal form. 1/1090 useless extension candidates. Maximal degree in co-relation 1005. Up to 314 conditions per place. [2025-03-04 06:59:59,787 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 20 selfloop transitions, 2 changer transitions 5/115 dead transitions. [2025-03-04 06:59:59,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 326 flow [2025-03-04 06:59:59,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:59,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2025-03-04 06:59:59,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8566978193146417 [2025-03-04 06:59:59,788 INFO L175 Difference]: Start difference. First operand has 114 places, 107 transitions, 256 flow. Second operand 6 states and 550 transitions. [2025-03-04 06:59:59,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 326 flow [2025-03-04 06:59:59,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 316 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:59:59,790 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 268 flow [2025-03-04 06:59:59,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2025-03-04 06:59:59,791 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 9 predicate places. [2025-03-04 06:59:59,791 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 268 flow [2025-03-04 06:59:59,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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:59:59,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:59,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:59,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:59:59,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-04 06:59:59,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1141158291, now seen corresponding path program 1 times [2025-03-04 06:59:59,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:59,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767064166] [2025-03-04 06:59:59,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:59,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:59,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 06:59:59,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 06:59:59,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:59,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:59,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:59:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767064166] [2025-03-04 06:59:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767064166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:59,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:59,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682454154] [2025-03-04 06:59:59,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:59,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:59,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:59,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:59,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2025-03-04 06:59:59,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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:59:59,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:59,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2025-03-04 06:59:59,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:59,917 INFO L124 PetriNetUnfolderBase]: 170/1036 cut-off events. [2025-03-04 06:59:59,917 INFO L125 PetriNetUnfolderBase]: For 197/324 co-relation queries the response was YES. [2025-03-04 06:59:59,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 1036 events. 170/1036 cut-off events. For 197/324 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7399 event pairs, 74 based on Foata normal form. 4/912 useless extension candidates. Maximal degree in co-relation 1591. Up to 268 conditions per place. [2025-03-04 06:59:59,923 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2025-03-04 06:59:59,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 117 transitions, 352 flow [2025-03-04 06:59:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2025-03-04 06:59:59,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252336448598131 [2025-03-04 06:59:59,924 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 268 flow. Second operand 3 states and 297 transitions. [2025-03-04 06:59:59,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 117 transitions, 352 flow [2025-03-04 06:59:59,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 340 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 06:59:59,928 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 312 flow [2025-03-04 06:59:59,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2025-03-04 06:59:59,929 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 6 predicate places. [2025-03-04 06:59:59,929 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 312 flow [2025-03-04 06:59:59,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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:59:59,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:59,931 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] [2025-03-04 06:59:59,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:59:59,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-04 06:59:59,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1404964843, now seen corresponding path program 1 times [2025-03-04 06:59:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:59,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395044773] [2025-03-04 06:59:59,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:59,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:59,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 06:59:59,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 06:59:59,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:59,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:00:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:00,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395044773] [2025-03-04 07:00:00,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395044773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:00,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:00,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:00:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813617291] [2025-03-04 07:00:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:00,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:00:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:00,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:00:00,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:00:00,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2025-03-04 07:00:00,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 312 flow. Second operand has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 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 07:00:00,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:00,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2025-03-04 07:00:00,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:00,328 INFO L124 PetriNetUnfolderBase]: 315/1606 cut-off events. [2025-03-04 07:00:00,328 INFO L125 PetriNetUnfolderBase]: For 249/289 co-relation queries the response was YES. [2025-03-04 07:00:00,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2618 conditions, 1606 events. 315/1606 cut-off events. For 249/289 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 12803 event pairs, 39 based on Foata normal form. 3/1456 useless extension candidates. Maximal degree in co-relation 1386. Up to 430 conditions per place. [2025-03-04 07:00:00,336 INFO L140 encePairwiseOnDemand]: 97/107 looper letters, 36 selfloop transitions, 10 changer transitions 2/138 dead transitions. [2025-03-04 07:00:00,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 138 transitions, 460 flow [2025-03-04 07:00:00,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:00:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 07:00:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 805 transitions. [2025-03-04 07:00:00,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8359293873312564 [2025-03-04 07:00:00,338 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 312 flow. Second operand 9 states and 805 transitions. [2025-03-04 07:00:00,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 138 transitions, 460 flow [2025-03-04 07:00:00,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 138 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:00:00,341 INFO L231 Difference]: Finished difference. Result has 127 places, 120 transitions, 365 flow [2025-03-04 07:00:00,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=365, PETRI_PLACES=127, PETRI_TRANSITIONS=120} [2025-03-04 07:00:00,341 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 18 predicate places. [2025-03-04 07:00:00,342 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 120 transitions, 365 flow [2025-03-04 07:00:00,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 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 07:00:00,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:00,342 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 07:00:00,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:00:00,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-04 07:00:00,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:00,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1683568454, now seen corresponding path program 1 times [2025-03-04 07:00:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:00,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912564081] [2025-03-04 07:00:00,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:00,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 07:00:00,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 07:00:00,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:00,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:00:00,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:00:00,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 07:00:00,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 07:00:00,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:00,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:00:00,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:00:00,379 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:00:00,379 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-04 07:00:00,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-04 07:00:00,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-04 07:00:00,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-04 07:00:00,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 07:00:00,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-04 07:00:00,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-04 07:00:00,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:00:00,380 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 07:00:00,417 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-03-04 07:00:00,418 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:00:00,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:00:00 BasicIcfg [2025-03-04 07:00:00,426 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:00:00,426 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:00:00,426 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:00:00,426 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:00:00,427 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:59:56" (3/4) ... [2025-03-04 07:00:00,427 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 07:00:00,474 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-03-04 07:00:00,505 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:00:00,506 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:00:00,506 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:00:00,506 INFO L158 Benchmark]: Toolchain (without parser) took 4379.21ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 110.0MB in the beginning and 59.5MB in the end (delta: 50.5MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2025-03-04 07:00:00,507 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 226.5MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:00:00,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.93ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 82.2MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 07:00:00,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.30ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 79.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:00:00,508 INFO L158 Benchmark]: Boogie Preprocessor took 16.01ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 78.8MB in the end (delta: 995.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:00:00,508 INFO L158 Benchmark]: IcfgBuilder took 336.71ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 63.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:00:00,509 INFO L158 Benchmark]: TraceAbstraction took 3489.62ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 62.5MB in the beginning and 69.9MB in the end (delta: -7.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2025-03-04 07:00:00,509 INFO L158 Benchmark]: Witness Printer took 79.68ms. Allocated memory is still 184.5MB. Free memory was 69.9MB in the beginning and 59.5MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:00:00,510 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.24ms. Allocated memory is still 226.5MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.93ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 82.2MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.30ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 79.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.01ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 78.8MB in the end (delta: 995.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 336.71ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 63.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3489.62ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 62.5MB in the beginning and 69.9MB in the end (delta: -7.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Witness Printer took 79.68ms. Allocated memory is still 184.5MB. Free memory was 69.9MB in the beginning and 59.5MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1023]: Data race detected Data race detected The following path leads to a data race: [L1019] 0 int data = 0; VAL [data=0] [L1020] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L1028] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_total=1] [L1029] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={1:0}] [L1029] RET 0 assume_abort_if_not(threads_total >= 0) [L1030] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, data_mutex={1:0}, threads_total=1, tids={-2:0}] [L1031] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=1, tids={-2:0}] [L1031] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}] [L1032] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=1, tids={-2:0}] [L1032] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=1, tids={-2:0}] [L1031] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=1, tids={-2:0}] [L1031] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1034] 0 int i = 0; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=1, tids={-2:0}] [L1034] COND FALSE 0 !(i < threads_total - 1) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1023] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1038] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=1, tids={-2:0}] [L1023] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [1038] and C: data = __VERIFIER_nondet_int() [1023] - UnprovableResult [Line: 1038]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: 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 3 procedures, 105 locations, 6 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.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 369 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 561 IncrementalHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 16 mSDtfsCounter, 561 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=4, InterpolantAutomatonStates: 27, 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.7s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 377 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 122 locations, 7 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.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 415 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 430 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 286 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 709 IncrementalHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 144 mSDtfsCounter, 709 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=5, InterpolantAutomatonStates: 27, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 377 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1/1 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 07:00:00,523 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)