./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_4-container_of.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 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:59:15,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:59:15,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:59:15,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:59:15,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:59:15,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:59:15,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:59:15,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:59:15,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:59:15,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:59:15,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:59:15,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:59:15,815 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:59:15,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:59:15,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:59:15,815 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:59:15,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:59:15,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:59:15,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:59:15,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:59:15,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:59:15,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:59:15,816 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:59:15,816 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:59:15,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:59:15,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:59:15,817 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:59:15,817 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:59:15,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:59:15,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:59:15,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:59:15,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:59:15,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:59:15,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:59:15,818 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:59:15,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:59:15,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:59:15,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:59:15,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:59:15,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:59:15,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:59:15,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:59:15,818 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 -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2025-03-17 10:59:16,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:59:16,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:59:16,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:59:16,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:59:16,080 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:59:16,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2025-03-17 10:59:17,319 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11c8310b/78b7c5d15f934580a83effd2bd75e254/FLAG2b5cfc32b [2025-03-17 10:59:17,606 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:59:17,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2025-03-17 10:59:17,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11c8310b/78b7c5d15f934580a83effd2bd75e254/FLAG2b5cfc32b [2025-03-17 10:59:17,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11c8310b/78b7c5d15f934580a83effd2bd75e254 [2025-03-17 10:59:17,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:59:17,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:59:17,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:17,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:59:17,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:59:17,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:17" (1/1) ... [2025-03-17 10:59:17,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf158bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:17, skipping insertion in model container [2025-03-17 10:59:17,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:17" (1/1) ... [2025-03-17 10:59:17,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:59:18,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:18,065 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:59:18,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:18,166 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:59:18,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18 WrapperNode [2025-03-17 10:59:18,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:18,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:18,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:59:18,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:59:18,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (1/1) ... [2025-03-17 10:59:18,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (1/1) ... [2025-03-17 10:59:18,216 INFO L138 Inliner]: procedures = 248, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 238 [2025-03-17 10:59:18,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:18,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:59:18,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:59:18,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:59:18,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (1/1) ... [2025-03-17 10:59:18,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (1/1) ... [2025-03-17 10:59:18,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (1/1) ... [2025-03-17 10:59:18,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (1/1) ... [2025-03-17 10:59:18,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (1/1) ... [2025-03-17 10:59:18,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (1/1) ... [2025-03-17 10:59:18,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (1/1) ... [2025-03-17 10:59:18,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (1/1) ... [2025-03-17 10:59:18,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:59:18,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:59:18,255 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:59:18,255 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:59:18,256 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (1/1) ... [2025-03-17 10:59:18,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:59:18,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:59:18,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:59:18,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:59:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-17 10:59:18,311 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:59:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:59:18,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:59:18,312 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:59:18,510 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:59:18,513 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:59:18,904 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:59:18,905 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:59:19,027 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:59:19,027 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:59:19,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:19 BoogieIcfgContainer [2025-03-17 10:59:19,028 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:59:19,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:59:19,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:59:19,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:59:19,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:59:17" (1/3) ... [2025-03-17 10:59:19,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e072215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:19, skipping insertion in model container [2025-03-17 10:59:19,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:18" (2/3) ... [2025-03-17 10:59:19,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e072215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:19, skipping insertion in model container [2025-03-17 10:59:19,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:19" (3/3) ... [2025-03-17 10:59:19,037 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2025-03-17 10:59:19,049 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:59:19,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_4-container_of.i that has 2 procedures, 235 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-03-17 10:59:19,051 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:59:19,113 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 10:59:19,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 266 transitions, 546 flow [2025-03-17 10:59:19,251 INFO L124 PetriNetUnfolderBase]: 14/357 cut-off events. [2025-03-17 10:59:19,253 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:59:19,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 357 events. 14/357 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 765 event pairs, 0 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 184. Up to 4 conditions per place. [2025-03-17 10:59:19,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 262 places, 266 transitions, 546 flow [2025-03-17 10:59:19,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 260 places, 263 transitions, 538 flow [2025-03-17 10:59:19,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:59:19,285 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;@412b00a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:59:19,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-17 10:59:19,293 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:59:19,293 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-17 10:59:19,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:59:19,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:19,295 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] [2025-03-17 10:59:19,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 10:59:19,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1674004658, now seen corresponding path program 1 times [2025-03-17 10:59:19,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:19,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824879385] [2025-03-17 10:59:19,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:19,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:19,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:59:19,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:59:19,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:19,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:59:20,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:20,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824879385] [2025-03-17 10:59:20,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824879385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:20,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:20,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:20,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292778518] [2025-03-17 10:59:20,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:20,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:20,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:20,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:20,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:20,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 266 [2025-03-17 10:59:20,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 263 transitions, 538 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:20,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:20,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 266 [2025-03-17 10:59:20,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:20,987 INFO L124 PetriNetUnfolderBase]: 1296/3943 cut-off events. [2025-03-17 10:59:20,987 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-17 10:59:21,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6106 conditions, 3943 events. 1296/3943 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 31376 event pairs, 1295 based on Foata normal form. 128/3868 useless extension candidates. Maximal degree in co-relation 5836. Up to 2134 conditions per place. [2025-03-17 10:59:21,018 INFO L140 encePairwiseOnDemand]: 242/266 looper letters, 47 selfloop transitions, 5 changer transitions 6/232 dead transitions. [2025-03-17 10:59:21,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 232 transitions, 580 flow [2025-03-17 10:59:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1217 transitions. [2025-03-17 10:59:21,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7625313283208021 [2025-03-17 10:59:21,039 INFO L175 Difference]: Start difference. First operand has 260 places, 263 transitions, 538 flow. Second operand 6 states and 1217 transitions. [2025-03-17 10:59:21,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 232 transitions, 580 flow [2025-03-17 10:59:21,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 232 transitions, 572 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 10:59:21,049 INFO L231 Difference]: Finished difference. Result has 238 places, 226 transitions, 466 flow [2025-03-17 10:59:21,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=238, PETRI_TRANSITIONS=226} [2025-03-17 10:59:21,055 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -22 predicate places. [2025-03-17 10:59:21,055 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 226 transitions, 466 flow [2025-03-17 10:59:21,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:21,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:21,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:21,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:59:21,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 10:59:21,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:21,058 INFO L85 PathProgramCache]: Analyzing trace with hash -636210485, now seen corresponding path program 1 times [2025-03-17 10:59:21,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:21,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675919661] [2025-03-17 10:59:21,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:21,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 10:59:21,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 10:59:21,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:21,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:59:21,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:21,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675919661] [2025-03-17 10:59:21,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675919661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:21,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:21,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:21,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277294870] [2025-03-17 10:59:21,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:21,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:21,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:21,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:21,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 266 [2025-03-17 10:59:21,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 226 transitions, 466 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:21,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:21,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 266 [2025-03-17 10:59:21,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:22,152 INFO L124 PetriNetUnfolderBase]: 1296/3936 cut-off events. [2025-03-17 10:59:22,152 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:59:22,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6089 conditions, 3936 events. 1296/3936 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 31427 event pairs, 1295 based on Foata normal form. 0/3736 useless extension candidates. Maximal degree in co-relation 6046. Up to 2134 conditions per place. [2025-03-17 10:59:22,183 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 47 selfloop transitions, 5 changer transitions 0/225 dead transitions. [2025-03-17 10:59:22,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 225 transitions, 568 flow [2025-03-17 10:59:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-03-17 10:59:22,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7512531328320802 [2025-03-17 10:59:22,187 INFO L175 Difference]: Start difference. First operand has 238 places, 226 transitions, 466 flow. Second operand 6 states and 1199 transitions. [2025-03-17 10:59:22,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 225 transitions, 568 flow [2025-03-17 10:59:22,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 225 transitions, 558 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:59:22,194 INFO L231 Difference]: Finished difference. Result has 231 places, 225 transitions, 464 flow [2025-03-17 10:59:22,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=231, PETRI_TRANSITIONS=225} [2025-03-17 10:59:22,197 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -29 predicate places. [2025-03-17 10:59:22,198 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 225 transitions, 464 flow [2025-03-17 10:59:22,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:22,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:22,199 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] [2025-03-17 10:59:22,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:59:22,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 10:59:22,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1653279198, now seen corresponding path program 1 times [2025-03-17 10:59:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:22,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035797473] [2025-03-17 10:59:22,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:22,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 10:59:22,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 10:59:22,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:22,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:59:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:22,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035797473] [2025-03-17 10:59:22,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035797473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:22,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:22,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:22,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339912123] [2025-03-17 10:59:22,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:22,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:22,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:22,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:22,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:22,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 266 [2025-03-17 10:59:22,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 225 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:22,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:22,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 266 [2025-03-17 10:59:22,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:22,516 INFO L124 PetriNetUnfolderBase]: 401/1330 cut-off events. [2025-03-17 10:59:22,516 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:59:22,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 1330 events. 401/1330 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8183 event pairs, 395 based on Foata normal form. 0/1276 useless extension candidates. Maximal degree in co-relation 1976. Up to 674 conditions per place. [2025-03-17 10:59:22,523 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 28 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2025-03-17 10:59:22,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 229 transitions, 532 flow [2025-03-17 10:59:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2025-03-17 10:59:22,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8583959899749374 [2025-03-17 10:59:22,527 INFO L175 Difference]: Start difference. First operand has 231 places, 225 transitions, 464 flow. Second operand 3 states and 685 transitions. [2025-03-17 10:59:22,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 229 transitions, 532 flow [2025-03-17 10:59:22,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 229 transitions, 522 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:59:22,532 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 456 flow [2025-03-17 10:59:22,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2025-03-17 10:59:22,534 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -33 predicate places. [2025-03-17 10:59:22,534 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 456 flow [2025-03-17 10:59:22,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:22,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:22,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:22,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:59:22,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 10:59:22,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1634960719, now seen corresponding path program 1 times [2025-03-17 10:59:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:22,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156403747] [2025-03-17 10:59:22,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:22,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:22,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 10:59:22,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 10:59:22,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:22,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:59:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156403747] [2025-03-17 10:59:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156403747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:22,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:22,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:22,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116355770] [2025-03-17 10:59:22,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:22,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:22,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:22,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:23,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 266 [2025-03-17 10:59:23,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 224 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:23,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:23,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 266 [2025-03-17 10:59:23,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:23,653 INFO L124 PetriNetUnfolderBase]: 1488/4068 cut-off events. [2025-03-17 10:59:23,653 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:59:23,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6526 conditions, 4068 events. 1488/4068 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 31270 event pairs, 1027 based on Foata normal form. 0/3909 useless extension candidates. Maximal degree in co-relation 6355. Up to 2110 conditions per place. [2025-03-17 10:59:23,668 INFO L140 encePairwiseOnDemand]: 253/266 looper letters, 61 selfloop transitions, 30 changer transitions 7/269 dead transitions. [2025-03-17 10:59:23,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 269 transitions, 734 flow [2025-03-17 10:59:23,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1265 transitions. [2025-03-17 10:59:23,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7926065162907269 [2025-03-17 10:59:23,672 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 456 flow. Second operand 6 states and 1265 transitions. [2025-03-17 10:59:23,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 269 transitions, 734 flow [2025-03-17 10:59:23,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 269 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:23,679 INFO L231 Difference]: Finished difference. Result has 235 places, 246 transitions, 640 flow [2025-03-17 10:59:23,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=640, PETRI_PLACES=235, PETRI_TRANSITIONS=246} [2025-03-17 10:59:23,681 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -25 predicate places. [2025-03-17 10:59:23,681 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 246 transitions, 640 flow [2025-03-17 10:59:23,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:23,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:23,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:23,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:59:23,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 10:59:23,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1723201395, now seen corresponding path program 1 times [2025-03-17 10:59:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:23,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550308412] [2025-03-17 10:59:23,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:23,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:23,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 10:59:23,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 10:59:23,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:23,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:23,728 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-17 10:59:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550308412] [2025-03-17 10:59:23,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550308412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:23,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:23,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:23,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886319970] [2025-03-17 10:59:23,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:23,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:23,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:23,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:23,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:23,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 266 [2025-03-17 10:59:23,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 246 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:23,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:23,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 266 [2025-03-17 10:59:23,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:24,029 INFO L124 PetriNetUnfolderBase]: 835/2630 cut-off events. [2025-03-17 10:59:24,030 INFO L125 PetriNetUnfolderBase]: For 680/684 co-relation queries the response was YES. [2025-03-17 10:59:24,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5116 conditions, 2630 events. 835/2630 cut-off events. For 680/684 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 19461 event pairs, 510 based on Foata normal form. 0/2468 useless extension candidates. Maximal degree in co-relation 3526. Up to 1117 conditions per place. [2025-03-17 10:59:24,047 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 57 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2025-03-17 10:59:24,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 255 transitions, 788 flow [2025-03-17 10:59:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2025-03-17 10:59:24,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8646616541353384 [2025-03-17 10:59:24,050 INFO L175 Difference]: Start difference. First operand has 235 places, 246 transitions, 640 flow. Second operand 3 states and 690 transitions. [2025-03-17 10:59:24,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 255 transitions, 788 flow [2025-03-17 10:59:24,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 255 transitions, 788 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:24,056 INFO L231 Difference]: Finished difference. Result has 229 places, 245 transitions, 642 flow [2025-03-17 10:59:24,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=229, PETRI_TRANSITIONS=245} [2025-03-17 10:59:24,057 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -31 predicate places. [2025-03-17 10:59:24,057 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 245 transitions, 642 flow [2025-03-17 10:59:24,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:24,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:24,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:24,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:59:24,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 10:59:24,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1411932348, now seen corresponding path program 1 times [2025-03-17 10:59:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246471724] [2025-03-17 10:59:24,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:24,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 10:59:24,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 10:59:24,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:24,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:24,142 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-17 10:59:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246471724] [2025-03-17 10:59:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246471724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:24,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:24,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648953761] [2025-03-17 10:59:24,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:24,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:24,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:24,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:24,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 266 [2025-03-17 10:59:24,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 245 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:24,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:24,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 266 [2025-03-17 10:59:24,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:24,460 INFO L124 PetriNetUnfolderBase]: 797/2046 cut-off events. [2025-03-17 10:59:24,460 INFO L125 PetriNetUnfolderBase]: For 711/756 co-relation queries the response was YES. [2025-03-17 10:59:24,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 2046 events. 797/2046 cut-off events. For 711/756 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13886 event pairs, 436 based on Foata normal form. 1/1970 useless extension candidates. Maximal degree in co-relation 4224. Up to 958 conditions per place. [2025-03-17 10:59:24,475 INFO L140 encePairwiseOnDemand]: 264/266 looper letters, 54 selfloop transitions, 1 changer transitions 0/254 dead transitions. [2025-03-17 10:59:24,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 254 transitions, 782 flow [2025-03-17 10:59:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2025-03-17 10:59:24,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.87468671679198 [2025-03-17 10:59:24,478 INFO L175 Difference]: Start difference. First operand has 229 places, 245 transitions, 642 flow. Second operand 3 states and 698 transitions. [2025-03-17 10:59:24,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 254 transitions, 782 flow [2025-03-17 10:59:24,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 254 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:24,488 INFO L231 Difference]: Finished difference. Result has 228 places, 244 transitions, 638 flow [2025-03-17 10:59:24,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=228, PETRI_TRANSITIONS=244} [2025-03-17 10:59:24,489 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -32 predicate places. [2025-03-17 10:59:24,490 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 244 transitions, 638 flow [2025-03-17 10:59:24,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:24,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:24,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:24,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:59:24,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 10:59:24,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash 849182640, now seen corresponding path program 1 times [2025-03-17 10:59:24,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:24,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278765512] [2025-03-17 10:59:24,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:24,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:24,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 10:59:24,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 10:59:24,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:24,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:24,920 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-17 10:59:24,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:24,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278765512] [2025-03-17 10:59:24,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278765512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:24,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:24,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108921679] [2025-03-17 10:59:24,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:24,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:24,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:24,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:25,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 266 [2025-03-17 10:59:25,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 244 transitions, 638 flow. Second operand has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:25,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:25,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 266 [2025-03-17 10:59:25,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:25,635 INFO L124 PetriNetUnfolderBase]: 1709/4122 cut-off events. [2025-03-17 10:59:25,635 INFO L125 PetriNetUnfolderBase]: For 1086/1129 co-relation queries the response was YES. [2025-03-17 10:59:25,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8553 conditions, 4122 events. 1709/4122 cut-off events. For 1086/1129 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 30692 event pairs, 1013 based on Foata normal form. 0/3952 useless extension candidates. Maximal degree in co-relation 8390. Up to 2322 conditions per place. [2025-03-17 10:59:25,659 INFO L140 encePairwiseOnDemand]: 253/266 looper letters, 84 selfloop transitions, 30 changer transitions 11/289 dead transitions. [2025-03-17 10:59:25,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 289 transitions, 1006 flow [2025-03-17 10:59:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1262 transitions. [2025-03-17 10:59:25,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7907268170426065 [2025-03-17 10:59:25,662 INFO L175 Difference]: Start difference. First operand has 228 places, 244 transitions, 638 flow. Second operand 6 states and 1262 transitions. [2025-03-17 10:59:25,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 289 transitions, 1006 flow [2025-03-17 10:59:25,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 289 transitions, 1005 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:59:25,668 INFO L231 Difference]: Finished difference. Result has 237 places, 262 transitions, 865 flow [2025-03-17 10:59:25,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=237, PETRI_TRANSITIONS=262} [2025-03-17 10:59:25,669 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -23 predicate places. [2025-03-17 10:59:25,669 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 262 transitions, 865 flow [2025-03-17 10:59:25,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:25,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:25,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:25,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:59:25,670 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 10:59:25,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:25,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1285520810, now seen corresponding path program 1 times [2025-03-17 10:59:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:25,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072686867] [2025-03-17 10:59:25,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:25,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:25,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 10:59:25,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:59:25,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:25,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:26,067 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-17 10:59:26,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:26,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072686867] [2025-03-17 10:59:26,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072686867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:26,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:26,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:26,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560354323] [2025-03-17 10:59:26,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:26,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:26,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:26,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:26,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:26,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 266 [2025-03-17 10:59:26,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 262 transitions, 865 flow. Second operand has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:26,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:26,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 266 [2025-03-17 10:59:26,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:26,871 INFO L124 PetriNetUnfolderBase]: 1874/4730 cut-off events. [2025-03-17 10:59:26,871 INFO L125 PetriNetUnfolderBase]: For 3015/3108 co-relation queries the response was YES. [2025-03-17 10:59:26,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11423 conditions, 4730 events. 1874/4730 cut-off events. For 3015/3108 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 37522 event pairs, 886 based on Foata normal form. 0/4605 useless extension candidates. Maximal degree in co-relation 6782. Up to 2473 conditions per place. [2025-03-17 10:59:26,951 INFO L140 encePairwiseOnDemand]: 250/266 looper letters, 115 selfloop transitions, 26 changer transitions 0/306 dead transitions. [2025-03-17 10:59:26,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 306 transitions, 1335 flow [2025-03-17 10:59:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1267 transitions. [2025-03-17 10:59:26,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.793859649122807 [2025-03-17 10:59:26,954 INFO L175 Difference]: Start difference. First operand has 237 places, 262 transitions, 865 flow. Second operand 6 states and 1267 transitions. [2025-03-17 10:59:26,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 306 transitions, 1335 flow [2025-03-17 10:59:26,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 306 transitions, 1287 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:26,963 INFO L231 Difference]: Finished difference. Result has 235 places, 282 transitions, 1049 flow [2025-03-17 10:59:26,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=235, PETRI_TRANSITIONS=282} [2025-03-17 10:59:26,964 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -25 predicate places. [2025-03-17 10:59:26,964 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 282 transitions, 1049 flow [2025-03-17 10:59:26,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:26,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:26,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:26,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:59:26,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 10:59:26,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1523168170, now seen corresponding path program 1 times [2025-03-17 10:59:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:26,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684655233] [2025-03-17 10:59:26,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:26,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:26,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 10:59:26,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 10:59:26,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:26,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:27,273 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-17 10:59:27,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:27,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684655233] [2025-03-17 10:59:27,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684655233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:27,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:27,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458247134] [2025-03-17 10:59:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:27,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:27,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:27,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:27,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 266 [2025-03-17 10:59:27,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 282 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:27,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:27,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 266 [2025-03-17 10:59:27,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:28,259 INFO L124 PetriNetUnfolderBase]: 2224/5087 cut-off events. [2025-03-17 10:59:28,259 INFO L125 PetriNetUnfolderBase]: For 5857/6117 co-relation queries the response was YES. [2025-03-17 10:59:28,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14170 conditions, 5087 events. 2224/5087 cut-off events. For 5857/6117 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 39085 event pairs, 987 based on Foata normal form. 70/5017 useless extension candidates. Maximal degree in co-relation 10174. Up to 2857 conditions per place. [2025-03-17 10:59:28,294 INFO L140 encePairwiseOnDemand]: 251/266 looper letters, 128 selfloop transitions, 36 changer transitions 38/341 dead transitions. [2025-03-17 10:59:28,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 341 transitions, 1769 flow [2025-03-17 10:59:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1265 transitions. [2025-03-17 10:59:28,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7926065162907269 [2025-03-17 10:59:28,298 INFO L175 Difference]: Start difference. First operand has 235 places, 282 transitions, 1049 flow. Second operand 6 states and 1265 transitions. [2025-03-17 10:59:28,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 341 transitions, 1769 flow [2025-03-17 10:59:28,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 341 transitions, 1769 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:28,308 INFO L231 Difference]: Finished difference. Result has 243 places, 279 transitions, 1379 flow [2025-03-17 10:59:28,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1379, PETRI_PLACES=243, PETRI_TRANSITIONS=279} [2025-03-17 10:59:28,309 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -17 predicate places. [2025-03-17 10:59:28,309 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 279 transitions, 1379 flow [2025-03-17 10:59:28,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:28,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:28,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:28,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:59:28,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 10:59:28,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:28,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1751405010, now seen corresponding path program 1 times [2025-03-17 10:59:28,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:28,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486333294] [2025-03-17 10:59:28,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:28,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:28,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 10:59:28,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 10:59:28,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:28,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:28,431 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-17 10:59:28,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:28,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486333294] [2025-03-17 10:59:28,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486333294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:28,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:28,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:28,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957645715] [2025-03-17 10:59:28,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:28,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:59:28,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:28,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:59:28,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:59:28,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 266 [2025-03-17 10:59:28,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 279 transitions, 1379 flow. Second operand has 5 states, 5 states have (on average 216.4) internal successors, (1082), 5 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:28,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:28,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 266 [2025-03-17 10:59:28,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:28,704 INFO L124 PetriNetUnfolderBase]: 575/1410 cut-off events. [2025-03-17 10:59:28,704 INFO L125 PetriNetUnfolderBase]: For 2631/2631 co-relation queries the response was YES. [2025-03-17 10:59:28,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 1410 events. 575/1410 cut-off events. For 2631/2631 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8990 event pairs, 30 based on Foata normal form. 0/1409 useless extension candidates. Maximal degree in co-relation 3623. Up to 587 conditions per place. [2025-03-17 10:59:28,712 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 61 selfloop transitions, 4 changer transitions 0/163 dead transitions. [2025-03-17 10:59:28,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 163 transitions, 660 flow [2025-03-17 10:59:28,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1350 transitions. [2025-03-17 10:59:28,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8458646616541353 [2025-03-17 10:59:28,715 INFO L175 Difference]: Start difference. First operand has 243 places, 279 transitions, 1379 flow. Second operand 6 states and 1350 transitions. [2025-03-17 10:59:28,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 163 transitions, 660 flow [2025-03-17 10:59:28,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 163 transitions, 520 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-03-17 10:59:28,719 INFO L231 Difference]: Finished difference. Result has 149 places, 123 transitions, 270 flow [2025-03-17 10:59:28,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=149, PETRI_TRANSITIONS=123} [2025-03-17 10:59:28,719 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -111 predicate places. [2025-03-17 10:59:28,719 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 123 transitions, 270 flow [2025-03-17 10:59:28,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 216.4) internal successors, (1082), 5 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:28,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:28,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:28,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:59:28,721 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 10:59:28,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:28,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1267953683, now seen corresponding path program 1 times [2025-03-17 10:59:28,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:28,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480937571] [2025-03-17 10:59:28,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:28,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:28,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 10:59:28,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 10:59:28,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:28,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:28,783 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-17 10:59:28,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:28,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480937571] [2025-03-17 10:59:28,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480937571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:28,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:28,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:28,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898272817] [2025-03-17 10:59:28,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:28,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:28,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:28,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:28,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:28,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 266 [2025-03-17 10:59:28,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 123 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:28,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:28,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 266 [2025-03-17 10:59:28,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:28,879 INFO L124 PetriNetUnfolderBase]: 285/776 cut-off events. [2025-03-17 10:59:28,879 INFO L125 PetriNetUnfolderBase]: For 150/152 co-relation queries the response was YES. [2025-03-17 10:59:28,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 776 events. 285/776 cut-off events. For 150/152 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4123 event pairs, 280 based on Foata normal form. 6/748 useless extension candidates. Maximal degree in co-relation 1512. Up to 479 conditions per place. [2025-03-17 10:59:28,882 INFO L140 encePairwiseOnDemand]: 264/266 looper letters, 0 selfloop transitions, 0 changer transitions 127/127 dead transitions. [2025-03-17 10:59:28,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 127 transitions, 332 flow [2025-03-17 10:59:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2025-03-17 10:59:28,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8659147869674185 [2025-03-17 10:59:28,884 INFO L175 Difference]: Start difference. First operand has 149 places, 123 transitions, 270 flow. Second operand 3 states and 691 transitions. [2025-03-17 10:59:28,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 127 transitions, 332 flow [2025-03-17 10:59:28,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 127 transitions, 325 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 10:59:28,885 INFO L231 Difference]: Finished difference. Result has 146 places, 0 transitions, 0 flow [2025-03-17 10:59:28,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=146, PETRI_TRANSITIONS=0} [2025-03-17 10:59:28,886 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -114 predicate places. [2025-03-17 10:59:28,886 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 0 transitions, 0 flow [2025-03-17 10:59:28,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:28,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-03-17 10:59:28,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-03-17 10:59:28,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:59:28,890 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:28,893 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 10:59:28,894 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 10:59:28,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 10:59:28 BasicIcfg [2025-03-17 10:59:28,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 10:59:28,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 10:59:28,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 10:59:28,898 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 10:59:28,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:19" (3/4) ... [2025-03-17 10:59:28,899 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 10:59:28,901 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-17 10:59:28,905 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-17 10:59:28,905 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 10:59:28,905 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 10:59:28,905 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 10:59:28,969 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 10:59:28,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 10:59:28,970 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 10:59:28,971 INFO L158 Benchmark]: Toolchain (without parser) took 11320.06ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 855.6MB). Free memory was 131.0MB in the beginning and 358.2MB in the end (delta: -227.1MB). Peak memory consumption was 630.5MB. Max. memory is 16.1GB. [2025-03-17 10:59:28,971 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:59:28,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.25ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 99.2MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 10:59:28,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.04ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 95.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:59:28,972 INFO L158 Benchmark]: Boogie Preprocessor took 36.61ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 92.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:59:28,973 INFO L158 Benchmark]: IcfgBuilder took 772.46ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 122.9MB in the end (delta: -30.6MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2025-03-17 10:59:28,973 INFO L158 Benchmark]: TraceAbstraction took 9866.19ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 855.6MB). Free memory was 122.0MB in the beginning and 362.5MB in the end (delta: -240.5MB). Peak memory consumption was 612.6MB. Max. memory is 16.1GB. [2025-03-17 10:59:28,973 INFO L158 Benchmark]: Witness Printer took 72.04ms. Allocated memory is still 1.0GB. Free memory was 362.5MB in the beginning and 358.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:59:28,974 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.25ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 99.2MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.04ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 95.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.61ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 92.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 772.46ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 122.9MB in the end (delta: -30.6MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9866.19ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 855.6MB). Free memory was 122.0MB in the beginning and 362.5MB in the end (delta: -240.5MB). Peak memory consumption was 612.6MB. Max. memory is 16.1GB. * Witness Printer took 72.04ms. Allocated memory is still 1.0GB. Free memory was 362.5MB in the beginning and 358.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3923]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3924]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3929]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3940]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3943]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3973]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3930]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3951]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3952]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3974]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3975]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3969]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3976]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3970]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3907]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3910]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3913]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 279 locations, 290 edges, 27 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: 9.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1181 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 682 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2832 IncrementalHoareTripleChecker+Invalid, 3179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 347 mSolverCounterUnsat, 34 mSDtfsCounter, 2832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1379occurred in iteration=9, InterpolantAutomatonStates: 54, 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.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 748 NumberOfCodeBlocks, 748 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 737 ConstructedInterpolants, 0 QuantifiedInterpolants, 1293 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 10:59:28,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE