./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.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/goblint-regression/28-race_reach_71-funloop_racing.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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:09:30,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:09:30,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:09:30,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:09:30,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:09:30,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:09:30,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:09:30,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:09:30,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:09:30,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:09:30,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:09:30,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:09:30,923 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:09:30,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:09:30,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:09:30,923 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:09:30,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:09:30,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:09:30,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:09:30,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:09:30,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:09:30,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:09:30,924 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:09:30,924 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:09:30,924 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:09:30,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:09:30,924 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:09:30,924 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:09:30,924 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:09:30,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:09:30,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:09:30,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:09:30,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:09:30,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:09:30,925 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:09:30,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:09:30,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:09:30,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:09:30,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:09:30,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:09:30,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:09:30,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:09:30,925 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2025-03-17 11:09:31,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:09:31,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:09:31,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:09:31,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:09:31,137 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:09:31,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-03-17 11:09:32,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26aa0a5ad/437f3ab461264805ab920229b0df5b81/FLAGe8cb685db [2025-03-17 11:09:32,512 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:09:32,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-03-17 11:09:32,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26aa0a5ad/437f3ab461264805ab920229b0df5b81/FLAGe8cb685db [2025-03-17 11:09:32,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26aa0a5ad/437f3ab461264805ab920229b0df5b81 [2025-03-17 11:09:32,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:09:32,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:09:32,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:09:32,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:09:32,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:09:32,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:09:32" (1/1) ... [2025-03-17 11:09:32,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f06443e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:32, skipping insertion in model container [2025-03-17 11:09:32,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:09:32" (1/1) ... [2025-03-17 11:09:32,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:09:33,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:09:33,156 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:09:33,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:09:33,227 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:09:33,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33 WrapperNode [2025-03-17 11:09:33,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:09:33,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:09:33,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:09:33,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:09:33,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (1/1) ... [2025-03-17 11:09:33,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (1/1) ... [2025-03-17 11:09:33,267 INFO L138 Inliner]: procedures = 272, calls = 108, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 412 [2025-03-17 11:09:33,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:09:33,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:09:33,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:09:33,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:09:33,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (1/1) ... [2025-03-17 11:09:33,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (1/1) ... [2025-03-17 11:09:33,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (1/1) ... [2025-03-17 11:09:33,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (1/1) ... [2025-03-17 11:09:33,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (1/1) ... [2025-03-17 11:09:33,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (1/1) ... [2025-03-17 11:09:33,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (1/1) ... [2025-03-17 11:09:33,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (1/1) ... [2025-03-17 11:09:33,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:09:33,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:09:33,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:09:33,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:09:33,311 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (1/1) ... [2025-03-17 11:09:33,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:09:33,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:09:33,338 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 11:09:33,341 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 11:09:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:09:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:09:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:09:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:09:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:09:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:09:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:09:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 11:09:33,359 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 11:09:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:09:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:09:33,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:09:33,360 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 11:09:33,476 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:09:33,477 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:09:33,900 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-17 11:09:33,900 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-17 11:09:33,991 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:09:33,991 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:09:34,030 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:09:34,030 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:09:34,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:09:34 BoogieIcfgContainer [2025-03-17 11:09:34,030 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:09:34,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:09:34,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:09:34,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:09:34,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:09:32" (1/3) ... [2025-03-17 11:09:34,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c00c1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:09:34, skipping insertion in model container [2025-03-17 11:09:34,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:09:33" (2/3) ... [2025-03-17 11:09:34,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c00c1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:09:34, skipping insertion in model container [2025-03-17 11:09:34,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:09:34" (3/3) ... [2025-03-17 11:09:34,039 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2025-03-17 11:09:34,049 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:09:34,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_71-funloop_racing.i that has 2 procedures, 394 locations, 1 initial locations, 17 loop locations, and 17 error locations. [2025-03-17 11:09:34,050 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:09:34,140 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:09:34,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 437 transitions, 881 flow [2025-03-17 11:09:34,309 INFO L124 PetriNetUnfolderBase]: 70/666 cut-off events. [2025-03-17 11:09:34,311 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:09:34,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 666 events. 70/666 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3310 event pairs, 0 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 343. Up to 8 conditions per place. [2025-03-17 11:09:34,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 437 transitions, 881 flow [2025-03-17 11:09:34,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 437 transitions, 881 flow [2025-03-17 11:09:34,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:09:34,344 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;@4cef369a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:09:34,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-17 11:09:34,356 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:09:34,356 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2025-03-17 11:09:34,356 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:09:34,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:34,357 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 11:09:34,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 11:09:34,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:34,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2098489746, now seen corresponding path program 1 times [2025-03-17 11:09:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:34,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073787620] [2025-03-17 11:09:34,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:34,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 11:09:34,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:09:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:34,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:34,675 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 11:09:34,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:34,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073787620] [2025-03-17 11:09:34,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073787620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:09:34,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:09:34,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:09:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328648229] [2025-03-17 11:09:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:09:34,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:09:34,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:34,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:09:34,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:09:34,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 437 [2025-03-17 11:09:34,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 437 transitions, 881 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 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 11:09:34,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:34,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 437 [2025-03-17 11:09:34,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:09:35,057 INFO L124 PetriNetUnfolderBase]: 161/2146 cut-off events. [2025-03-17 11:09:35,057 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-17 11:09:35,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 2146 events. 161/2146 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17330 event pairs, 120 based on Foata normal form. 285/2245 useless extension candidates. Maximal degree in co-relation 2124. Up to 302 conditions per place. [2025-03-17 11:09:35,069 INFO L140 encePairwiseOnDemand]: 398/437 looper letters, 29 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2025-03-17 11:09:35,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 396 transitions, 861 flow [2025-03-17 11:09:35,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:09:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:09:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-03-17 11:09:35,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8939740655987796 [2025-03-17 11:09:35,087 INFO L175 Difference]: Start difference. First operand has 397 places, 437 transitions, 881 flow. Second operand 3 states and 1172 transitions. [2025-03-17 11:09:35,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 396 transitions, 861 flow [2025-03-17 11:09:35,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 396 transitions, 861 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:09:35,101 INFO L231 Difference]: Finished difference. Result has 394 places, 396 transitions, 809 flow [2025-03-17 11:09:35,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=809, PETRI_PLACES=394, PETRI_TRANSITIONS=396} [2025-03-17 11:09:35,107 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -3 predicate places. [2025-03-17 11:09:35,107 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 396 transitions, 809 flow [2025-03-17 11:09:35,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 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 11:09:35,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:35,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:35,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:09:35,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 11:09:35,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1912307688, now seen corresponding path program 1 times [2025-03-17 11:09:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:35,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232992486] [2025-03-17 11:09:35,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:35,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 11:09:35,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 11:09:35,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:35,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:35,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:35,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232992486] [2025-03-17 11:09:35,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232992486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:09:35,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482945774] [2025-03-17 11:09:35,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:35,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:09:35,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:09:35,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:09:35,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:09:35,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 11:09:35,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 11:09:35,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:35,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:35,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:09:35,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:09:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:35,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:09:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:35,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482945774] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:09:35,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:09:35,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:09:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221882827] [2025-03-17 11:09:35,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:09:35,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:09:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:35,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:09:35,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:09:35,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 437 [2025-03-17 11:09:35,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 396 transitions, 809 flow. Second operand has 10 states, 10 states have (on average 366.8) internal successors, (3668), 10 states have internal predecessors, (3668), 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 11:09:35,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:35,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 437 [2025-03-17 11:09:35,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:09:35,830 INFO L124 PetriNetUnfolderBase]: 161/2153 cut-off events. [2025-03-17 11:09:35,830 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-17 11:09:35,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 2153 events. 161/2153 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17425 event pairs, 120 based on Foata normal form. 2/1969 useless extension candidates. Maximal degree in co-relation 2386. Up to 302 conditions per place. [2025-03-17 11:09:35,839 INFO L140 encePairwiseOnDemand]: 431/437 looper letters, 33 selfloop transitions, 9 changer transitions 0/404 dead transitions. [2025-03-17 11:09:35,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 404 transitions, 911 flow [2025-03-17 11:09:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:09:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:09:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3329 transitions. [2025-03-17 11:09:35,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464276633613018 [2025-03-17 11:09:35,845 INFO L175 Difference]: Start difference. First operand has 394 places, 396 transitions, 809 flow. Second operand 9 states and 3329 transitions. [2025-03-17 11:09:35,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 404 transitions, 911 flow [2025-03-17 11:09:35,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 404 transitions, 909 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:09:35,850 INFO L231 Difference]: Finished difference. Result has 404 places, 402 transitions, 857 flow [2025-03-17 11:09:35,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=857, PETRI_PLACES=404, PETRI_TRANSITIONS=402} [2025-03-17 11:09:35,851 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, 7 predicate places. [2025-03-17 11:09:35,851 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 402 transitions, 857 flow [2025-03-17 11:09:35,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 366.8) internal successors, (3668), 10 states have internal predecessors, (3668), 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 11:09:35,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:35,853 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:35,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:09:36,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:09:36,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 11:09:36,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1046328408, now seen corresponding path program 2 times [2025-03-17 11:09:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833918499] [2025-03-17 11:09:36,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:09:36,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:36,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-17 11:09:36,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-03-17 11:09:36,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:09:36,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:09:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833918499] [2025-03-17 11:09:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833918499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:09:36,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:09:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:09:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473517079] [2025-03-17 11:09:36,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:09:36,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:09:36,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:36,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:09:36,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:09:36,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 437 [2025-03-17 11:09:36,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 402 transitions, 857 flow. Second operand has 6 states, 6 states have (on average 297.5) internal successors, (1785), 6 states have internal predecessors, (1785), 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 11:09:36,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:36,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 437 [2025-03-17 11:09:36,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:09:37,970 INFO L124 PetriNetUnfolderBase]: 2280/9205 cut-off events. [2025-03-17 11:09:37,971 INFO L125 PetriNetUnfolderBase]: For 14/17 co-relation queries the response was YES. [2025-03-17 11:09:37,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13691 conditions, 9205 events. 2280/9205 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 94294 event pairs, 1764 based on Foata normal form. 0/8367 useless extension candidates. Maximal degree in co-relation 13567. Up to 4224 conditions per place. [2025-03-17 11:09:38,015 INFO L140 encePairwiseOnDemand]: 410/437 looper letters, 133 selfloop transitions, 86 changer transitions 0/519 dead transitions. [2025-03-17 11:09:38,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 519 transitions, 1529 flow [2025-03-17 11:09:38,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:09:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:09:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1996 transitions. [2025-03-17 11:09:38,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7612509534706331 [2025-03-17 11:09:38,021 INFO L175 Difference]: Start difference. First operand has 404 places, 402 transitions, 857 flow. Second operand 6 states and 1996 transitions. [2025-03-17 11:09:38,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 519 transitions, 1529 flow [2025-03-17 11:09:38,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 519 transitions, 1523 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:09:38,034 INFO L231 Difference]: Finished difference. Result has 413 places, 487 transitions, 1417 flow [2025-03-17 11:09:38,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1417, PETRI_PLACES=413, PETRI_TRANSITIONS=487} [2025-03-17 11:09:38,035 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, 16 predicate places. [2025-03-17 11:09:38,035 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 487 transitions, 1417 flow [2025-03-17 11:09:38,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.5) internal successors, (1785), 6 states have internal predecessors, (1785), 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 11:09:38,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:38,037 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:38,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:09:38,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 11:09:38,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash -60315904, now seen corresponding path program 1 times [2025-03-17 11:09:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:38,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137998601] [2025-03-17 11:09:38,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:38,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:38,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 11:09:38,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 11:09:38,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:38,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:09:38,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:38,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137998601] [2025-03-17 11:09:38,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137998601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:09:38,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:09:38,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:09:38,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952981518] [2025-03-17 11:09:38,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:09:38,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:09:38,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:38,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:09:38,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:09:38,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 437 [2025-03-17 11:09:38,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 487 transitions, 1417 flow. Second operand has 3 states, 3 states have (on average 369.6666666666667) internal successors, (1109), 3 states have internal predecessors, (1109), 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 11:09:38,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:38,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 437 [2025-03-17 11:09:38,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:09:38,456 INFO L124 PetriNetUnfolderBase]: 359/2982 cut-off events. [2025-03-17 11:09:38,456 INFO L125 PetriNetUnfolderBase]: For 158/180 co-relation queries the response was YES. [2025-03-17 11:09:38,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4042 conditions, 2982 events. 359/2982 cut-off events. For 158/180 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 26556 event pairs, 136 based on Foata normal form. 1/2735 useless extension candidates. Maximal degree in co-relation 3916. Up to 374 conditions per place. [2025-03-17 11:09:38,466 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 36 selfloop transitions, 3 changer transitions 0/495 dead transitions. [2025-03-17 11:09:38,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 495 transitions, 1511 flow [2025-03-17 11:09:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:09:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:09:38,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2025-03-17 11:09:38,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8718535469107551 [2025-03-17 11:09:38,469 INFO L175 Difference]: Start difference. First operand has 413 places, 487 transitions, 1417 flow. Second operand 3 states and 1143 transitions. [2025-03-17 11:09:38,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 495 transitions, 1511 flow [2025-03-17 11:09:38,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 495 transitions, 1511 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:09:38,476 INFO L231 Difference]: Finished difference. Result has 416 places, 487 transitions, 1428 flow [2025-03-17 11:09:38,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1428, PETRI_PLACES=416, PETRI_TRANSITIONS=487} [2025-03-17 11:09:38,477 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, 19 predicate places. [2025-03-17 11:09:38,477 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 487 transitions, 1428 flow [2025-03-17 11:09:38,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.6666666666667) internal successors, (1109), 3 states have internal predecessors, (1109), 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 11:09:38,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:38,478 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:38,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:09:38,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 11:09:38,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1686794726, now seen corresponding path program 1 times [2025-03-17 11:09:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:38,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231345293] [2025-03-17 11:09:38,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:38,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:38,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 11:09:38,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 11:09:38,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:38,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:38,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:38,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231345293] [2025-03-17 11:09:38,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231345293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:09:38,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989349344] [2025-03-17 11:09:38,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:38,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:09:38,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:09:38,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:09:38,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:09:38,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 11:09:38,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 11:09:38,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:38,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:38,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:09:38,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:09:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:38,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:09:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:38,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989349344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:09:38,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:09:38,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-17 11:09:38,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293897662] [2025-03-17 11:09:38,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:09:38,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:09:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:38,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:09:38,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:09:38,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 437 [2025-03-17 11:09:38,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 487 transitions, 1428 flow. Second operand has 18 states, 18 states have (on average 366.94444444444446) internal successors, (6605), 18 states have internal predecessors, (6605), 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 11:09:38,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:38,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 437 [2025-03-17 11:09:38,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:09:39,385 INFO L124 PetriNetUnfolderBase]: 343/2885 cut-off events. [2025-03-17 11:09:39,385 INFO L125 PetriNetUnfolderBase]: For 171/212 co-relation queries the response was YES. [2025-03-17 11:09:39,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4278 conditions, 2885 events. 343/2885 cut-off events. For 171/212 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 25358 event pairs, 120 based on Foata normal form. 4/2664 useless extension candidates. Maximal degree in co-relation 4076. Up to 556 conditions per place. [2025-03-17 11:09:39,398 INFO L140 encePairwiseOnDemand]: 431/437 looper letters, 37 selfloop transitions, 21 changer transitions 0/505 dead transitions. [2025-03-17 11:09:39,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 505 transitions, 1632 flow [2025-03-17 11:09:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:09:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 11:09:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 7727 transitions. [2025-03-17 11:09:39,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.84199629508554 [2025-03-17 11:09:39,413 INFO L175 Difference]: Start difference. First operand has 416 places, 487 transitions, 1428 flow. Second operand 21 states and 7727 transitions. [2025-03-17 11:09:39,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 505 transitions, 1632 flow [2025-03-17 11:09:39,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 505 transitions, 1626 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:09:39,425 INFO L231 Difference]: Finished difference. Result has 439 places, 500 transitions, 1552 flow [2025-03-17 11:09:39,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1552, PETRI_PLACES=439, PETRI_TRANSITIONS=500} [2025-03-17 11:09:39,426 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, 42 predicate places. [2025-03-17 11:09:39,427 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 500 transitions, 1552 flow [2025-03-17 11:09:39,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 366.94444444444446) internal successors, (6605), 18 states have internal predecessors, (6605), 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 11:09:39,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:39,431 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:39,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:09:39,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:09:39,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 11:09:39,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1018955162, now seen corresponding path program 2 times [2025-03-17 11:09:39,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:39,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081776405] [2025-03-17 11:09:39,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:09:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:39,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-17 11:09:39,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 11:09:39,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:09:39,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:39,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081776405] [2025-03-17 11:09:39,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081776405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:09:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708993019] [2025-03-17 11:09:39,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:09:39,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:09:39,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:09:39,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:09:39,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:09:40,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-17 11:09:40,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 11:09:40,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:09:40,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:40,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:09:40,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:09:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:40,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:09:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:40,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708993019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:09:40,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:09:40,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-17 11:09:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102975710] [2025-03-17 11:09:40,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:09:40,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:09:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:40,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:09:40,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:09:40,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 437 [2025-03-17 11:09:40,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 500 transitions, 1552 flow. Second operand has 23 states, 23 states have (on average 367.04347826086956) internal successors, (8442), 23 states have internal predecessors, (8442), 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 11:09:40,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:40,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 437 [2025-03-17 11:09:40,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:09:40,995 INFO L124 PetriNetUnfolderBase]: 343/2900 cut-off events. [2025-03-17 11:09:40,995 INFO L125 PetriNetUnfolderBase]: For 272/313 co-relation queries the response was YES. [2025-03-17 11:09:41,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4378 conditions, 2900 events. 343/2900 cut-off events. For 272/313 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 25351 event pairs, 120 based on Foata normal form. 3/2678 useless extension candidates. Maximal degree in co-relation 4076. Up to 556 conditions per place. [2025-03-17 11:09:41,008 INFO L140 encePairwiseOnDemand]: 431/437 looper letters, 40 selfloop transitions, 30 changer transitions 0/517 dead transitions. [2025-03-17 11:09:41,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 517 transitions, 1820 flow [2025-03-17 11:09:41,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 11:09:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 11:09:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11023 transitions. [2025-03-17 11:09:41,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8408085430968726 [2025-03-17 11:09:41,024 INFO L175 Difference]: Start difference. First operand has 439 places, 500 transitions, 1552 flow. Second operand 30 states and 11023 transitions. [2025-03-17 11:09:41,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 517 transitions, 1820 flow [2025-03-17 11:09:41,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 517 transitions, 1790 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-17 11:09:41,033 INFO L231 Difference]: Finished difference. Result has 466 places, 510 transitions, 1680 flow [2025-03-17 11:09:41,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1680, PETRI_PLACES=466, PETRI_TRANSITIONS=510} [2025-03-17 11:09:41,034 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, 69 predicate places. [2025-03-17 11:09:41,034 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 510 transitions, 1680 flow [2025-03-17 11:09:41,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 367.04347826086956) internal successors, (8442), 23 states have internal predecessors, (8442), 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 11:09:41,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:41,037 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:41,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:09:41,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:09:41,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 11:09:41,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:41,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1376267552, now seen corresponding path program 3 times [2025-03-17 11:09:41,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:41,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482060846] [2025-03-17 11:09:41,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:09:41,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:41,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 11 equivalence classes. [2025-03-17 11:09:41,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 11:09:41,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 11:09:41,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:09:41,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:09:41,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 11:09:41,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 11:09:41,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:41,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:09:41,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:09:41,368 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:09:41,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-17 11:09:41,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-17 11:09:41,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-17 11:09:41,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-17 11:09:41,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-17 11:09:41,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-17 11:09:41,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:09:41,371 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-03-17 11:09:41,373 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:09:41,373 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:09:41,410 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:09:41,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 497 places, 550 transitions, 1116 flow [2025-03-17 11:09:41,496 INFO L124 PetriNetUnfolderBase]: 113/1035 cut-off events. [2025-03-17 11:09:41,497 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:09:41,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 1035 events. 113/1035 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6019 event pairs, 0 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 668. Up to 12 conditions per place. [2025-03-17 11:09:41,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 497 places, 550 transitions, 1116 flow [2025-03-17 11:09:41,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 497 places, 550 transitions, 1116 flow [2025-03-17 11:09:41,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:09:41,513 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;@4cef369a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:09:41,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-17 11:09:41,518 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:09:41,518 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2025-03-17 11:09:41,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:09:41,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:41,518 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 11:09:41,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:09:41,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1288867528, now seen corresponding path program 1 times [2025-03-17 11:09:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:41,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178395552] [2025-03-17 11:09:41,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:41,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 11:09:41,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:09:41,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:41,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:41,549 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 11:09:41,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:41,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178395552] [2025-03-17 11:09:41,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178395552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:09:41,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:09:41,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:09:41,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068058042] [2025-03-17 11:09:41,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:09:41,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:09:41,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:41,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:09:41,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:09:41,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 550 [2025-03-17 11:09:41,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 550 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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 11:09:41,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:41,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 550 [2025-03-17 11:09:41,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:09:43,639 INFO L124 PetriNetUnfolderBase]: 2887/20258 cut-off events. [2025-03-17 11:09:43,639 INFO L125 PetriNetUnfolderBase]: For 151/155 co-relation queries the response was YES. [2025-03-17 11:09:43,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24514 conditions, 20258 events. 2887/20258 cut-off events. For 151/155 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 271154 event pairs, 2376 based on Foata normal form. 3869/22410 useless extension candidates. Maximal degree in co-relation 21856. Up to 4183 conditions per place. [2025-03-17 11:09:43,760 INFO L140 encePairwiseOnDemand]: 499/550 looper letters, 39 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2025-03-17 11:09:43,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 495 transitions, 1088 flow [2025-03-17 11:09:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:09:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:09:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1464 transitions. [2025-03-17 11:09:43,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8872727272727273 [2025-03-17 11:09:43,764 INFO L175 Difference]: Start difference. First operand has 497 places, 550 transitions, 1116 flow. Second operand 3 states and 1464 transitions. [2025-03-17 11:09:43,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 495 transitions, 1088 flow [2025-03-17 11:09:43,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 495 transitions, 1088 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:09:43,772 INFO L231 Difference]: Finished difference. Result has 492 places, 495 transitions, 1016 flow [2025-03-17 11:09:43,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=550, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=492, PETRI_TRANSITIONS=495} [2025-03-17 11:09:43,773 INFO L279 CegarLoopForPetriNet]: 497 programPoint places, -5 predicate places. [2025-03-17 11:09:43,773 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 495 transitions, 1016 flow [2025-03-17 11:09:43,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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 11:09:43,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:43,774 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] [2025-03-17 11:09:43,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:09:43,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:09:43,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:43,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1812277464, now seen corresponding path program 1 times [2025-03-17 11:09:43,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:43,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908065148] [2025-03-17 11:09:43,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:43,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:43,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 11:09:43,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 11:09:43,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:43,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908065148] [2025-03-17 11:09:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908065148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:09:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970614706] [2025-03-17 11:09:43,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:09:43,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:09:43,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:09:43,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:09:43,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:09:43,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 11:09:43,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 11:09:43,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:09:43,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:43,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:09:43,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:09:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:43,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:09:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:09:43,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970614706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:09:43,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:09:43,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:09:43,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765203216] [2025-03-17 11:09:43,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:09:43,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:09:43,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:43,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:09:43,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:09:44,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 550 [2025-03-17 11:09:44,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 495 transitions, 1016 flow. Second operand has 10 states, 10 states have (on average 456.8) internal successors, (4568), 10 states have internal predecessors, (4568), 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 11:09:44,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:44,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 550 [2025-03-17 11:09:44,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:09:46,214 INFO L124 PetriNetUnfolderBase]: 2887/20265 cut-off events. [2025-03-17 11:09:46,215 INFO L125 PetriNetUnfolderBase]: For 152/156 co-relation queries the response was YES. [2025-03-17 11:09:46,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24540 conditions, 20265 events. 2887/20265 cut-off events. For 152/156 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 271108 event pairs, 2376 based on Foata normal form. 2/18550 useless extension candidates. Maximal degree in co-relation 24444. Up to 4183 conditions per place. [2025-03-17 11:09:46,337 INFO L140 encePairwiseOnDemand]: 544/550 looper letters, 43 selfloop transitions, 9 changer transitions 0/503 dead transitions. [2025-03-17 11:09:46,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 503 transitions, 1138 flow [2025-03-17 11:09:46,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:09:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:09:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4149 transitions. [2025-03-17 11:09:46,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8381818181818181 [2025-03-17 11:09:46,342 INFO L175 Difference]: Start difference. First operand has 492 places, 495 transitions, 1016 flow. Second operand 9 states and 4149 transitions. [2025-03-17 11:09:46,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 503 transitions, 1138 flow [2025-03-17 11:09:46,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 503 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:09:46,349 INFO L231 Difference]: Finished difference. Result has 502 places, 501 transitions, 1064 flow [2025-03-17 11:09:46,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=550, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1064, PETRI_PLACES=502, PETRI_TRANSITIONS=501} [2025-03-17 11:09:46,350 INFO L279 CegarLoopForPetriNet]: 497 programPoint places, 5 predicate places. [2025-03-17 11:09:46,350 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 501 transitions, 1064 flow [2025-03-17 11:09:46,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 456.8) internal successors, (4568), 10 states have internal predecessors, (4568), 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 11:09:46,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:09:46,352 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:46,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:09:46,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:09:46,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:09:46,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:09:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1547560152, now seen corresponding path program 2 times [2025-03-17 11:09:46,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:09:46,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346600055] [2025-03-17 11:09:46,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:09:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:09:46,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-17 11:09:46,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-03-17 11:09:46,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:09:46,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:09:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:09:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:09:47,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346600055] [2025-03-17 11:09:47,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346600055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:09:47,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:09:47,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:09:47,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756091423] [2025-03-17 11:09:47,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:09:47,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:09:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:09:47,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:09:47,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:09:47,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 550 [2025-03-17 11:09:47,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 501 transitions, 1064 flow. Second operand has 6 states, 6 states have (on average 367.5) internal successors, (2205), 6 states have internal predecessors, (2205), 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 11:09:47,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:09:47,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 550 [2025-03-17 11:09:47,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand