./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:35:25,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:35:25,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:35:25,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:35:25,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:35:25,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:35:25,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:35:25,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:35:25,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:35:25,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:35:25,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:35:25,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:35:25,680 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:35:25,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:35:25,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:35:25,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:35:25,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:35:25,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:35:25,681 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:35:25,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:35:25,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:35:25,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:35:25,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:35:25,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:35:25,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:35:25,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:35:25,681 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-jdk21/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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2025-02-08 05:35:25,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:35:25,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:35:25,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:35:25,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:35:25,921 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:35:25,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-02-08 05:35:27,083 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34d78309b/b97b928a2b814315914ec76643ae0428/FLAG89fbe551f [2025-02-08 05:35:27,440 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:35:27,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-02-08 05:35:27,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34d78309b/b97b928a2b814315914ec76643ae0428/FLAG89fbe551f [2025-02-08 05:35:27,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34d78309b/b97b928a2b814315914ec76643ae0428 [2025-02-08 05:35:27,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:35:27,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:35:27,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:35:27,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:35:27,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:35:27,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:35:27" (1/1) ... [2025-02-08 05:35:27,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369d8ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:27, skipping insertion in model container [2025-02-08 05:35:27,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:35:27" (1/1) ... [2025-02-08 05:35:27,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:35:27,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:35:27,897 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:35:27,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:35:28,019 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:35:28,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28 WrapperNode [2025-02-08 05:35:28,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:35:28,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:35:28,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:35:28,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:35:28,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (1/1) ... [2025-02-08 05:35:28,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (1/1) ... [2025-02-08 05:35:28,074 INFO L138 Inliner]: procedures = 272, calls = 110, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 418 [2025-02-08 05:35:28,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:35:28,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:35:28,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:35:28,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:35:28,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (1/1) ... [2025-02-08 05:35:28,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (1/1) ... [2025-02-08 05:35:28,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (1/1) ... [2025-02-08 05:35:28,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (1/1) ... [2025-02-08 05:35:28,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (1/1) ... [2025-02-08 05:35:28,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (1/1) ... [2025-02-08 05:35:28,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (1/1) ... [2025-02-08 05:35:28,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (1/1) ... [2025-02-08 05:35:28,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:35:28,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:35:28,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:35:28,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:35:28,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (1/1) ... [2025-02-08 05:35:28,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:35:28,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:35:28,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:35:28,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:35:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:35:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:35:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:35:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:35:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:35:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:35:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:35:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:35:28,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:35:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:35:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:35:28,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:35:28,176 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:35:28,304 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:35:28,309 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:35:28,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 05:35:28,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 05:35:28,912 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:35:28,912 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:35:28,944 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:35:28,944 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:35:28,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:35:28 BoogieIcfgContainer [2025-02-08 05:35:28,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:35:28,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:35:28,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:35:28,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:35:28,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:35:27" (1/3) ... [2025-02-08 05:35:28,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8d7209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:35:28, skipping insertion in model container [2025-02-08 05:35:28,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:28" (2/3) ... [2025-02-08 05:35:28,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8d7209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:35:28, skipping insertion in model container [2025-02-08 05:35:28,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:35:28" (3/3) ... [2025-02-08 05:35:28,952 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-02-08 05:35:28,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:35:28,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 410 locations, 1 initial locations, 20 loop locations, and 17 error locations. [2025-02-08 05:35:28,963 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:35:29,035 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:35:29,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 453 transitions, 913 flow [2025-02-08 05:35:29,215 INFO L124 PetriNetUnfolderBase]: 70/694 cut-off events. [2025-02-08 05:35:29,217 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:35:29,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 694 events. 70/694 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3508 event pairs, 0 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 359. Up to 8 conditions per place. [2025-02-08 05:35:29,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 413 places, 453 transitions, 913 flow [2025-02-08 05:35:29,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 413 places, 453 transitions, 913 flow [2025-02-08 05:35:29,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:35:29,246 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;@33708478, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:35:29,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 05:35:29,275 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:35:29,275 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-02-08 05:35:29,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:35:29,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:29,276 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-02-08 05:35:29,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-08 05:35:29,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1702817099, now seen corresponding path program 1 times [2025-02-08 05:35:29,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:29,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745715955] [2025-02-08 05:35:29,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:29,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:35:29,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:35:29,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:29,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:29,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:29,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745715955] [2025-02-08 05:35:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745715955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:29,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:35:29,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515232756] [2025-02-08 05:35:29,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:29,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:29,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:29,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:29,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:29,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 453 [2025-02-08 05:35:29,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 453 transitions, 913 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-02-08 05:35:29,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:29,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 453 [2025-02-08 05:35:29,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:30,060 INFO L124 PetriNetUnfolderBase]: 181/2448 cut-off events. [2025-02-08 05:35:30,061 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-02-08 05:35:30,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 2448 events. 181/2448 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20392 event pairs, 136 based on Foata normal form. 453/2703 useless extension candidates. Maximal degree in co-relation 2450. Up to 340 conditions per place. [2025-02-08 05:35:30,074 INFO L140 encePairwiseOnDemand]: 414/453 looper letters, 31 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2025-02-08 05:35:30,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 412 transitions, 897 flow [2025-02-08 05:35:30,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2025-02-08 05:35:30,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947755702722591 [2025-02-08 05:35:30,088 INFO L175 Difference]: Start difference. First operand has 413 places, 453 transitions, 913 flow. Second operand 3 states and 1216 transitions. [2025-02-08 05:35:30,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 412 transitions, 897 flow [2025-02-08 05:35:30,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 412 transitions, 897 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:30,100 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 841 flow [2025-02-08 05:35:30,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=841, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2025-02-08 05:35:30,105 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -3 predicate places. [2025-02-08 05:35:30,106 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 841 flow [2025-02-08 05:35:30,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-02-08 05:35:30,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:30,107 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-02-08 05:35:30,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:35:30,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-08 05:35:30,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:30,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1614871829, now seen corresponding path program 1 times [2025-02-08 05:35:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:30,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452975410] [2025-02-08 05:35:30,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:30,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:30,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:35:30,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:35:30,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:30,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:30,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:30,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452975410] [2025-02-08 05:35:30,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452975410] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:35:30,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477592346] [2025-02-08 05:35:30,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:30,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:35:30,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:35:30,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:35:30,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:35:30,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:35:30,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:35:30,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:30,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:35:30,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:35:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:30,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:35:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:30,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477592346] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:35:30,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:35:30,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:35:30,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055475173] [2025-02-08 05:35:30,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:35:30,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:35:30,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:30,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:35:30,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:35:30,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 453 [2025-02-08 05:35:30,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 841 flow. Second operand has 10 states, 10 states have (on average 380.8) internal successors, (3808), 10 states have internal predecessors, (3808), 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-02-08 05:35:30,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:30,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 453 [2025-02-08 05:35:30,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:31,005 INFO L124 PetriNetUnfolderBase]: 181/2455 cut-off events. [2025-02-08 05:35:31,006 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-02-08 05:35:31,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 2455 events. 181/2455 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20393 event pairs, 136 based on Foata normal form. 2/2259 useless extension candidates. Maximal degree in co-relation 2726. Up to 340 conditions per place. [2025-02-08 05:35:31,016 INFO L140 encePairwiseOnDemand]: 447/453 looper letters, 35 selfloop transitions, 9 changer transitions 0/420 dead transitions. [2025-02-08 05:35:31,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 420 transitions, 947 flow [2025-02-08 05:35:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:35:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:35:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3457 transitions. [2025-02-08 05:35:31,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479273975962718 [2025-02-08 05:35:31,022 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 841 flow. Second operand 9 states and 3457 transitions. [2025-02-08 05:35:31,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 420 transitions, 947 flow [2025-02-08 05:35:31,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 420 transitions, 945 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:35:31,027 INFO L231 Difference]: Finished difference. Result has 420 places, 418 transitions, 889 flow [2025-02-08 05:35:31,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=889, PETRI_PLACES=420, PETRI_TRANSITIONS=418} [2025-02-08 05:35:31,029 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, 7 predicate places. [2025-02-08 05:35:31,029 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 418 transitions, 889 flow [2025-02-08 05:35:31,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 380.8) internal successors, (3808), 10 states have internal predecessors, (3808), 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-02-08 05:35:31,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:31,031 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-02-08 05:35:31,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:35:31,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:35:31,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-08 05:35:31,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:31,233 INFO L85 PathProgramCache]: Analyzing trace with hash -266010901, now seen corresponding path program 2 times [2025-02-08 05:35:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:31,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400808997] [2025-02-08 05:35:31,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:35:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:31,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-02-08 05:35:31,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-02-08 05:35:31,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:35:31,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:35:31,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:31,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400808997] [2025-02-08 05:35:31,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400808997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:31,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:31,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:35:31,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424871939] [2025-02-08 05:35:31,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:31,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:35:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:31,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:35:31,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:35:31,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 453 [2025-02-08 05:35:31,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 418 transitions, 889 flow. Second operand has 6 states, 6 states have (on average 311.5) internal successors, (1869), 6 states have internal predecessors, (1869), 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-02-08 05:35:31,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:31,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 453 [2025-02-08 05:35:31,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:33,333 INFO L124 PetriNetUnfolderBase]: 2315/9255 cut-off events. [2025-02-08 05:35:33,334 INFO L125 PetriNetUnfolderBase]: For 11/14 co-relation queries the response was YES. [2025-02-08 05:35:33,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13840 conditions, 9255 events. 2315/9255 cut-off events. For 11/14 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 94467 event pairs, 1632 based on Foata normal form. 0/8469 useless extension candidates. Maximal degree in co-relation 13716. Up to 4323 conditions per place. [2025-02-08 05:35:33,370 INFO L140 encePairwiseOnDemand]: 426/453 looper letters, 135 selfloop transitions, 86 changer transitions 0/535 dead transitions. [2025-02-08 05:35:33,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 535 transitions, 1565 flow [2025-02-08 05:35:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:35:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:35:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2082 transitions. [2025-02-08 05:35:33,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7660044150110376 [2025-02-08 05:35:33,375 INFO L175 Difference]: Start difference. First operand has 420 places, 418 transitions, 889 flow. Second operand 6 states and 2082 transitions. [2025-02-08 05:35:33,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 535 transitions, 1565 flow [2025-02-08 05:35:33,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 535 transitions, 1559 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 05:35:33,384 INFO L231 Difference]: Finished difference. Result has 429 places, 503 transitions, 1449 flow [2025-02-08 05:35:33,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1449, PETRI_PLACES=429, PETRI_TRANSITIONS=503} [2025-02-08 05:35:33,385 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, 16 predicate places. [2025-02-08 05:35:33,385 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 503 transitions, 1449 flow [2025-02-08 05:35:33,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.5) internal successors, (1869), 6 states have internal predecessors, (1869), 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-02-08 05:35:33,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:33,387 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, 1, 1, 1] [2025-02-08 05:35:33,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:35:33,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-08 05:35:33,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1018413347, now seen corresponding path program 1 times [2025-02-08 05:35:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:33,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405426681] [2025-02-08 05:35:33,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:33,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:33,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 05:35:33,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 05:35:33,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:33,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:35:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:33,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405426681] [2025-02-08 05:35:33,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405426681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:33,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:33,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:35:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106567839] [2025-02-08 05:35:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:33,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:33,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:33,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:33,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:33,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 453 [2025-02-08 05:35:33,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 503 transitions, 1449 flow. Second operand has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 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-02-08 05:35:33,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:33,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 453 [2025-02-08 05:35:33,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:33,868 INFO L124 PetriNetUnfolderBase]: 349/3111 cut-off events. [2025-02-08 05:35:33,869 INFO L125 PetriNetUnfolderBase]: For 158/183 co-relation queries the response was YES. [2025-02-08 05:35:33,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4179 conditions, 3111 events. 349/3111 cut-off events. For 158/183 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 28114 event pairs, 152 based on Foata normal form. 1/2858 useless extension candidates. Maximal degree in co-relation 4053. Up to 410 conditions per place. [2025-02-08 05:35:33,881 INFO L140 encePairwiseOnDemand]: 450/453 looper letters, 38 selfloop transitions, 3 changer transitions 0/511 dead transitions. [2025-02-08 05:35:33,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 511 transitions, 1547 flow [2025-02-08 05:35:33,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2025-02-08 05:35:33,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734363502575423 [2025-02-08 05:35:33,883 INFO L175 Difference]: Start difference. First operand has 429 places, 503 transitions, 1449 flow. Second operand 3 states and 1187 transitions. [2025-02-08 05:35:33,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 511 transitions, 1547 flow [2025-02-08 05:35:33,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 511 transitions, 1547 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:33,891 INFO L231 Difference]: Finished difference. Result has 432 places, 503 transitions, 1460 flow [2025-02-08 05:35:33,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=432, PETRI_TRANSITIONS=503} [2025-02-08 05:35:33,892 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, 19 predicate places. [2025-02-08 05:35:33,892 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 503 transitions, 1460 flow [2025-02-08 05:35:33,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 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-02-08 05:35:33,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:33,893 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-02-08 05:35:33,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:35:33,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-08 05:35:33,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:33,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1060010204, now seen corresponding path program 1 times [2025-02-08 05:35:33,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:33,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567115227] [2025-02-08 05:35:33,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:33,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:33,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:35:33,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:35:33,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:33,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:34,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:34,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567115227] [2025-02-08 05:35:34,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567115227] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:35:34,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621423968] [2025-02-08 05:35:34,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:34,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:35:34,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:35:34,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:35:34,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:35:34,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:35:34,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:35:34,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:34,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:34,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:35:34,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:35:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:34,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:35:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:34,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621423968] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:35:34,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:35:34,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-08 05:35:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689701512] [2025-02-08 05:35:34,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:35:34,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 05:35:34,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:34,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 05:35:34,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:35:34,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 453 [2025-02-08 05:35:34,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 503 transitions, 1460 flow. Second operand has 18 states, 18 states have (on average 380.94444444444446) internal successors, (6857), 18 states have internal predecessors, (6857), 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-02-08 05:35:34,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:34,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 453 [2025-02-08 05:35:34,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:34,753 INFO L124 PetriNetUnfolderBase]: 329/3111 cut-off events. [2025-02-08 05:35:34,753 INFO L125 PetriNetUnfolderBase]: For 171/214 co-relation queries the response was YES. [2025-02-08 05:35:34,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4367 conditions, 3111 events. 329/3111 cut-off events. For 171/214 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 28084 event pairs, 136 based on Foata normal form. 4/2877 useless extension candidates. Maximal degree in co-relation 4165. Up to 416 conditions per place. [2025-02-08 05:35:34,769 INFO L140 encePairwiseOnDemand]: 447/453 looper letters, 39 selfloop transitions, 21 changer transitions 0/521 dead transitions. [2025-02-08 05:35:34,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 521 transitions, 1668 flow [2025-02-08 05:35:34,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:35:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:35:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 8023 transitions. [2025-02-08 05:35:34,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433722274781877 [2025-02-08 05:35:34,782 INFO L175 Difference]: Start difference. First operand has 432 places, 503 transitions, 1460 flow. Second operand 21 states and 8023 transitions. [2025-02-08 05:35:34,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 521 transitions, 1668 flow [2025-02-08 05:35:34,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 521 transitions, 1662 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:35:34,793 INFO L231 Difference]: Finished difference. Result has 455 places, 516 transitions, 1584 flow [2025-02-08 05:35:34,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1584, PETRI_PLACES=455, PETRI_TRANSITIONS=516} [2025-02-08 05:35:34,796 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, 42 predicate places. [2025-02-08 05:35:34,798 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 516 transitions, 1584 flow [2025-02-08 05:35:34,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 380.94444444444446) internal successors, (6857), 18 states have internal predecessors, (6857), 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-02-08 05:35:34,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:34,801 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-02-08 05:35:34,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 05:35:35,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:35:35,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-08 05:35:35,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:35,002 INFO L85 PathProgramCache]: Analyzing trace with hash -785088292, now seen corresponding path program 2 times [2025-02-08 05:35:35,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:35,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249556432] [2025-02-08 05:35:35,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:35:35,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:35,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-02-08 05:35:35,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:35:35,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:35:35,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:35,381 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:35,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:35,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249556432] [2025-02-08 05:35:35,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249556432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:35:35,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216953197] [2025-02-08 05:35:35,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:35:35,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:35:35,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:35:35,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:35:35,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 05:35:35,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-02-08 05:35:35,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:35:35,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:35:35,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:35,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 05:35:35,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:35:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:35,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:35:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:35,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216953197] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:35:35,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:35:35,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-08 05:35:35,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910066399] [2025-02-08 05:35:35,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:35:35,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 05:35:35,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:35,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 05:35:35,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-08 05:35:35,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 453 [2025-02-08 05:35:35,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 516 transitions, 1584 flow. Second operand has 23 states, 23 states have (on average 381.04347826086956) internal successors, (8764), 23 states have internal predecessors, (8764), 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-02-08 05:35:35,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:35,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 453 [2025-02-08 05:35:35,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:36,690 INFO L124 PetriNetUnfolderBase]: 329/3126 cut-off events. [2025-02-08 05:35:36,691 INFO L125 PetriNetUnfolderBase]: For 272/315 co-relation queries the response was YES. [2025-02-08 05:35:36,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4467 conditions, 3126 events. 329/3126 cut-off events. For 272/315 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 28028 event pairs, 136 based on Foata normal form. 3/2891 useless extension candidates. Maximal degree in co-relation 4165. Up to 416 conditions per place. [2025-02-08 05:35:36,704 INFO L140 encePairwiseOnDemand]: 447/453 looper letters, 42 selfloop transitions, 30 changer transitions 0/533 dead transitions. [2025-02-08 05:35:36,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 533 transitions, 1856 flow [2025-02-08 05:35:36,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 05:35:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-08 05:35:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11445 transitions. [2025-02-08 05:35:36,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421633554083885 [2025-02-08 05:35:36,721 INFO L175 Difference]: Start difference. First operand has 455 places, 516 transitions, 1584 flow. Second operand 30 states and 11445 transitions. [2025-02-08 05:35:36,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 533 transitions, 1856 flow [2025-02-08 05:35:36,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 533 transitions, 1826 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-02-08 05:35:36,731 INFO L231 Difference]: Finished difference. Result has 482 places, 526 transitions, 1712 flow [2025-02-08 05:35:36,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1712, PETRI_PLACES=482, PETRI_TRANSITIONS=526} [2025-02-08 05:35:36,733 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, 69 predicate places. [2025-02-08 05:35:36,733 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 526 transitions, 1712 flow [2025-02-08 05:35:36,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 381.04347826086956) internal successors, (8764), 23 states have internal predecessors, (8764), 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-02-08 05:35:36,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:36,735 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-02-08 05:35:36,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 05:35:36,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:35:36,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-08 05:35:36,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:36,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1706628484, now seen corresponding path program 3 times [2025-02-08 05:35:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:36,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104466820] [2025-02-08 05:35:36,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:35:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:36,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 11 equivalence classes. [2025-02-08 05:35:37,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 05:35:37,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 05:35:37,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:35:37,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:35:37,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 05:35:37,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 05:35:37,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:37,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:35:37,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:35:37,091 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:35:37,093 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-02-08 05:35:37,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-02-08 05:35:37,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-02-08 05:35:37,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-02-08 05:35:37,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-02-08 05:35:37,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-02-08 05:35:37,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-02-08 05:35:37,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-02-08 05:35:37,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-02-08 05:35:37,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-02-08 05:35:37,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-02-08 05:35:37,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-02-08 05:35:37,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-02-08 05:35:37,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-02-08 05:35:37,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-02-08 05:35:37,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-02-08 05:35:37,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-02-08 05:35:37,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-02-08 05:35:37,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-02-08 05:35:37,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-02-08 05:35:37,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-02-08 05:35:37,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-02-08 05:35:37,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-02-08 05:35:37,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:35:37,099 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-02-08 05:35:37,101 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:35:37,101 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:35:37,179 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:35:37,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 517 places, 570 transitions, 1156 flow [2025-02-08 05:35:37,461 INFO L124 PetriNetUnfolderBase]: 113/1079 cut-off events. [2025-02-08 05:35:37,461 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:35:37,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 1079 events. 113/1079 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6404 event pairs, 0 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 696. Up to 12 conditions per place. [2025-02-08 05:35:37,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 517 places, 570 transitions, 1156 flow [2025-02-08 05:35:37,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 517 places, 570 transitions, 1156 flow [2025-02-08 05:35:37,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:35:37,483 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;@33708478, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:35:37,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-08 05:35:37,491 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:35:37,491 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-02-08 05:35:37,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:35:37,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:37,492 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-02-08 05:35:37,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:35:37,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash -792542715, now seen corresponding path program 1 times [2025-02-08 05:35:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:37,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945364066] [2025-02-08 05:35:37,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:37,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:37,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:35:37,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:35:37,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:37,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:37,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:37,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945364066] [2025-02-08 05:35:37,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945364066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:37,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:37,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:35:37,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849510147] [2025-02-08 05:35:37,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:37,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:37,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:37,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:37,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:37,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 570 [2025-02-08 05:35:37,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 570 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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-02-08 05:35:37,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:37,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 570 [2025-02-08 05:35:37,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:40,088 INFO L124 PetriNetUnfolderBase]: 3251/23508 cut-off events. [2025-02-08 05:35:40,088 INFO L125 PetriNetUnfolderBase]: For 151/155 co-relation queries the response was YES. [2025-02-08 05:35:40,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28288 conditions, 23508 events. 3251/23508 cut-off events. For 151/155 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 320250 event pairs, 2680 based on Foata normal form. 6277/27918 useless extension candidates. Maximal degree in co-relation 25286. Up to 4707 conditions per place. [2025-02-08 05:35:40,211 INFO L140 encePairwiseOnDemand]: 519/570 looper letters, 41 selfloop transitions, 2 changer transitions 0/515 dead transitions. [2025-02-08 05:35:40,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 515 transitions, 1132 flow [2025-02-08 05:35:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1520 transitions. [2025-02-08 05:35:40,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-02-08 05:35:40,215 INFO L175 Difference]: Start difference. First operand has 517 places, 570 transitions, 1156 flow. Second operand 3 states and 1520 transitions. [2025-02-08 05:35:40,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 515 transitions, 1132 flow [2025-02-08 05:35:40,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 515 transitions, 1132 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:40,220 INFO L231 Difference]: Finished difference. Result has 512 places, 515 transitions, 1056 flow [2025-02-08 05:35:40,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=570, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=512, PETRI_TRANSITIONS=515} [2025-02-08 05:35:40,221 INFO L279 CegarLoopForPetriNet]: 517 programPoint places, -5 predicate places. [2025-02-08 05:35:40,221 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 515 transitions, 1056 flow [2025-02-08 05:35:40,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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-02-08 05:35:40,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:40,222 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-02-08 05:35:40,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:35:40,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:35:40,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:40,222 INFO L85 PathProgramCache]: Analyzing trace with hash -409917909, now seen corresponding path program 1 times [2025-02-08 05:35:40,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:40,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618652254] [2025-02-08 05:35:40,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:40,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:40,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:35:40,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:35:40,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:40,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:40,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:40,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618652254] [2025-02-08 05:35:40,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618652254] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:35:40,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821121899] [2025-02-08 05:35:40,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:40,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:35:40,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:35:40,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:35:40,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 05:35:40,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:35:40,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:35:40,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:40,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:40,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:35:40,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:35:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:40,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:35:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:40,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821121899] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:35:40,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:35:40,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:35:40,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083012870] [2025-02-08 05:35:40,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:35:40,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:35:40,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:40,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:35:40,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:35:40,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 570 [2025-02-08 05:35:40,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 515 transitions, 1056 flow. Second operand has 10 states, 10 states have (on average 474.8) internal successors, (4748), 10 states have internal predecessors, (4748), 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-02-08 05:35:40,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:40,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 570 [2025-02-08 05:35:40,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:43,309 INFO L124 PetriNetUnfolderBase]: 3251/23515 cut-off events. [2025-02-08 05:35:43,309 INFO L125 PetriNetUnfolderBase]: For 150/154 co-relation queries the response was YES. [2025-02-08 05:35:43,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28314 conditions, 23515 events. 3251/23515 cut-off events. For 150/154 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 320360 event pairs, 2680 based on Foata normal form. 2/21650 useless extension candidates. Maximal degree in co-relation 28218. Up to 4707 conditions per place. [2025-02-08 05:35:43,569 INFO L140 encePairwiseOnDemand]: 564/570 looper letters, 45 selfloop transitions, 9 changer transitions 0/523 dead transitions. [2025-02-08 05:35:43,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 523 transitions, 1182 flow [2025-02-08 05:35:43,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:35:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:35:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4313 transitions. [2025-02-08 05:35:43,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2025-02-08 05:35:43,580 INFO L175 Difference]: Start difference. First operand has 512 places, 515 transitions, 1056 flow. Second operand 9 states and 4313 transitions. [2025-02-08 05:35:43,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 523 transitions, 1182 flow [2025-02-08 05:35:43,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 523 transitions, 1180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:35:43,591 INFO L231 Difference]: Finished difference. Result has 522 places, 521 transitions, 1104 flow [2025-02-08 05:35:43,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=570, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1104, PETRI_PLACES=522, PETRI_TRANSITIONS=521} [2025-02-08 05:35:43,593 INFO L279 CegarLoopForPetriNet]: 517 programPoint places, 5 predicate places. [2025-02-08 05:35:43,594 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 521 transitions, 1104 flow [2025-02-08 05:35:43,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 474.8) internal successors, (4748), 10 states have internal predecessors, (4748), 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-02-08 05:35:43,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:43,595 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-02-08 05:35:43,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 05:35:43,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 05:35:43,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:35:43,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1542629781, now seen corresponding path program 2 times [2025-02-08 05:35:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:43,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122388040] [2025-02-08 05:35:43,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:35:43,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:43,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-02-08 05:35:43,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-02-08 05:35:43,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:35:43,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:35:44,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:44,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122388040] [2025-02-08 05:35:44,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122388040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:44,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:44,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:35:44,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576400712] [2025-02-08 05:35:44,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:44,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:35:44,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:44,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:35:44,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:35:44,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 570 [2025-02-08 05:35:44,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 521 transitions, 1104 flow. Second operand has 6 states, 6 states have (on average 385.5) internal successors, (2313), 6 states have internal predecessors, (2313), 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-02-08 05:35:44,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:44,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 570 [2025-02-08 05:35:44,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand