./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.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_70-funloop_racefree.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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:35:20,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:35:20,466 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:20,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:35:20,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:35:20,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:35:20,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:35:20,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:35:20,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:35:20,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:35:20,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:35:20,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:35:20,504 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:35:20,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:35:20,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:35:20,504 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:35:20,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:35:20,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:35:20,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:35:20,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:35:20,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:35:20,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:35:20,505 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:35:20,505 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:35:20,505 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:35:20,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:35:20,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:35:20,505 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:35:20,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:35:20,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:35:20,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:35:20,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:35:20,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:35:20,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:35:20,507 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:35:20,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:35:20,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:35:20,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:35:20,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:35:20,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:35:20,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:35:20,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:35:20,507 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2025-02-08 05:35:20,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:35:20,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:35:20,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:35:20,722 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:35:20,723 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:35:20,724 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_70-funloop_racefree.i [2025-02-08 05:35:21,925 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e52e171b9/30a022008c8a45d096a70142212c3ee7/FLAG6f38c734d [2025-02-08 05:35:22,303 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:35:22,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-02-08 05:35:22,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e52e171b9/30a022008c8a45d096a70142212c3ee7/FLAG6f38c734d [2025-02-08 05:35:22,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e52e171b9/30a022008c8a45d096a70142212c3ee7 [2025-02-08 05:35:22,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:35:22,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:35:22,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:35:22,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:35:22,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:35:22,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:35:22" (1/1) ... [2025-02-08 05:35:22,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769cd687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:22, skipping insertion in model container [2025-02-08 05:35:22,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:35:22" (1/1) ... [2025-02-08 05:35:22,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:35:22,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:35:22,914 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:35:22,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:35:22,987 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:35:22,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:22 WrapperNode [2025-02-08 05:35:22,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:35:22,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:35:22,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:35:22,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:35:22,993 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:22" (1/1) ... [2025-02-08 05:35:23,011 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:22" (1/1) ... [2025-02-08 05:35:23,042 INFO L138 Inliner]: procedures = 272, calls = 96, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 325 [2025-02-08 05:35:23,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:35:23,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:35:23,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:35:23,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:35:23,052 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:22" (1/1) ... [2025-02-08 05:35:23,052 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:22" (1/1) ... [2025-02-08 05:35:23,059 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:22" (1/1) ... [2025-02-08 05:35:23,059 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:22" (1/1) ... [2025-02-08 05:35:23,076 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:22" (1/1) ... [2025-02-08 05:35:23,079 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:22" (1/1) ... [2025-02-08 05:35:23,081 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:22" (1/1) ... [2025-02-08 05:35:23,081 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:22" (1/1) ... [2025-02-08 05:35:23,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:35:23,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:35:23,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:35:23,084 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:35:23,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:22" (1/1) ... [2025-02-08 05:35:23,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:35:23,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:35:23,126 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:23,137 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:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:35:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:35:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:35:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:35:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:35:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:35:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:35:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:35:23,154 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:35:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:35:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:35:23,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:35:23,155 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:23,283 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:35:23,285 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:35:23,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 05:35:23,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 05:35:23,737 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:35:23,737 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:35:23,798 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:35:23,798 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:35:23,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:35:23 BoogieIcfgContainer [2025-02-08 05:35:23,799 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:35:23,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:35:23,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:35:23,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:35:23,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:35:22" (1/3) ... [2025-02-08 05:35:23,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efa802e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:35:23, skipping insertion in model container [2025-02-08 05:35:23,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:22" (2/3) ... [2025-02-08 05:35:23,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efa802e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:35:23, skipping insertion in model container [2025-02-08 05:35:23,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:35:23" (3/3) ... [2025-02-08 05:35:23,805 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-02-08 05:35:23,825 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:35:23,826 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 323 locations, 1 initial locations, 15 loop locations, and 12 error locations. [2025-02-08 05:35:23,826 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:35:23,933 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:35:23,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 326 places, 353 transitions, 713 flow [2025-02-08 05:35:24,089 INFO L124 PetriNetUnfolderBase]: 44/494 cut-off events. [2025-02-08 05:35:24,091 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:35:24,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 494 events. 44/494 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1915 event pairs, 0 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 259. Up to 8 conditions per place. [2025-02-08 05:35:24,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 326 places, 353 transitions, 713 flow [2025-02-08 05:35:24,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 326 places, 353 transitions, 713 flow [2025-02-08 05:35:24,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:35:24,122 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;@376ca89d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:35:24,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-08 05:35:24,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:35:24,139 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-02-08 05:35:24,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:35:24,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:24,142 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:24,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:35:24,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1678617850, now seen corresponding path program 1 times [2025-02-08 05:35:24,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:24,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763087637] [2025-02-08 05:35:24,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:24,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:24,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:35:24,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:35:24,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:24,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:24,524 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:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:24,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763087637] [2025-02-08 05:35:24,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763087637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:24,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:24,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:35:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165097076] [2025-02-08 05:35:24,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:24,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:24,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:24,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:24,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:24,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 353 [2025-02-08 05:35:24,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 353 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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:24,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:24,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 353 [2025-02-08 05:35:24,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:24,860 INFO L124 PetriNetUnfolderBase]: 98/1419 cut-off events. [2025-02-08 05:35:24,860 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:35:24,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 1419 events. 98/1419 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9253 event pairs, 72 based on Foata normal form. 239/1545 useless extension candidates. Maximal degree in co-relation 1364. Up to 187 conditions per place. [2025-02-08 05:35:24,872 INFO L140 encePairwiseOnDemand]: 326/353 looper letters, 23 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2025-02-08 05:35:24,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 326 transitions, 709 flow [2025-02-08 05:35:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2025-02-08 05:35:24,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055712936732767 [2025-02-08 05:35:24,892 INFO L175 Difference]: Start difference. First operand has 326 places, 353 transitions, 713 flow. Second operand 3 states and 959 transitions. [2025-02-08 05:35:24,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 326 transitions, 709 flow [2025-02-08 05:35:24,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 326 transitions, 709 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:24,907 INFO L231 Difference]: Finished difference. Result has 325 places, 326 transitions, 669 flow [2025-02-08 05:35:24,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=325, PETRI_TRANSITIONS=326} [2025-02-08 05:35:24,912 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -1 predicate places. [2025-02-08 05:35:24,913 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 326 transitions, 669 flow [2025-02-08 05:35:24,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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:24,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:24,914 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:24,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:35:24,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:35:24,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash 395316421, now seen corresponding path program 1 times [2025-02-08 05:35:24,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:24,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120758000] [2025-02-08 05:35:24,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:24,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:24,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:35:24,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:35:24,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:24,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:25,139 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:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:25,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120758000] [2025-02-08 05:35:25,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120758000] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:35:25,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760571843] [2025-02-08 05:35:25,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:25,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:35:25,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:35:25,145 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:25,146 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:25,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:35:25,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:35:25,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:25,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:25,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:35:25,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:35:25,356 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:25,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:35:25,388 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:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760571843] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:35:25,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:35:25,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:35:25,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701259122] [2025-02-08 05:35:25,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:35:25,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:35:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:25,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:35:25,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:35:25,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 353 [2025-02-08 05:35:25,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 326 transitions, 669 flow. Second operand has 10 states, 10 states have (on average 301.8) internal successors, (3018), 10 states have internal predecessors, (3018), 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:25,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:25,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 353 [2025-02-08 05:35:25,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:25,726 INFO L124 PetriNetUnfolderBase]: 98/1426 cut-off events. [2025-02-08 05:35:25,726 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-08 05:35:25,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 1426 events. 98/1426 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9255 event pairs, 72 based on Foata normal form. 2/1315 useless extension candidates. Maximal degree in co-relation 1543. Up to 187 conditions per place. [2025-02-08 05:35:25,734 INFO L140 encePairwiseOnDemand]: 347/353 looper letters, 27 selfloop transitions, 9 changer transitions 0/334 dead transitions. [2025-02-08 05:35:25,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 334 transitions, 759 flow [2025-02-08 05:35:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:35:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:35:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2738 transitions. [2025-02-08 05:35:25,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8618193264085615 [2025-02-08 05:35:25,740 INFO L175 Difference]: Start difference. First operand has 325 places, 326 transitions, 669 flow. Second operand 9 states and 2738 transitions. [2025-02-08 05:35:25,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 334 transitions, 759 flow [2025-02-08 05:35:25,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 334 transitions, 757 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:35:25,746 INFO L231 Difference]: Finished difference. Result has 335 places, 332 transitions, 717 flow [2025-02-08 05:35:25,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=717, PETRI_PLACES=335, PETRI_TRANSITIONS=332} [2025-02-08 05:35:25,747 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, 9 predicate places. [2025-02-08 05:35:25,747 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 332 transitions, 717 flow [2025-02-08 05:35:25,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 301.8) internal successors, (3018), 10 states have internal predecessors, (3018), 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:25,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:25,750 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:25,756 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:25,954 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:25,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:35:25,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash 62351717, now seen corresponding path program 2 times [2025-02-08 05:35:25,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:25,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798161089] [2025-02-08 05:35:25,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:35:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:25,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-02-08 05:35:25,993 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:25,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:35:25,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:26,494 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:26,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:26,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798161089] [2025-02-08 05:35:26,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798161089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:26,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:26,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:35:26,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250966443] [2025-02-08 05:35:26,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:26,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:35:26,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:26,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:35:26,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:35:26,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 353 [2025-02-08 05:35:26,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 332 transitions, 717 flow. Second operand has 6 states, 6 states have (on average 252.5) internal successors, (1515), 6 states have internal predecessors, (1515), 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:26,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:26,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 353 [2025-02-08 05:35:26,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:27,677 INFO L124 PetriNetUnfolderBase]: 1447/5995 cut-off events. [2025-02-08 05:35:27,677 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:35:27,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8890 conditions, 5995 events. 1447/5995 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 55065 event pairs, 1036 based on Foata normal form. 0/5475 useless extension candidates. Maximal degree in co-relation 8766. Up to 2633 conditions per place. [2025-02-08 05:35:27,698 INFO L140 encePairwiseOnDemand]: 326/353 looper letters, 107 selfloop transitions, 86 changer transitions 0/449 dead transitions. [2025-02-08 05:35:27,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 449 transitions, 1337 flow [2025-02-08 05:35:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:35:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:35:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1700 transitions. [2025-02-08 05:35:27,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8026440037771483 [2025-02-08 05:35:27,702 INFO L175 Difference]: Start difference. First operand has 335 places, 332 transitions, 717 flow. Second operand 6 states and 1700 transitions. [2025-02-08 05:35:27,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 449 transitions, 1337 flow [2025-02-08 05:35:27,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 449 transitions, 1331 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 05:35:27,709 INFO L231 Difference]: Finished difference. Result has 344 places, 417 transitions, 1277 flow [2025-02-08 05:35:27,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1277, PETRI_PLACES=344, PETRI_TRANSITIONS=417} [2025-02-08 05:35:27,710 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, 18 predicate places. [2025-02-08 05:35:27,710 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 417 transitions, 1277 flow [2025-02-08 05:35:27,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.5) internal successors, (1515), 6 states have internal predecessors, (1515), 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:27,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:27,711 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] [2025-02-08 05:35:27,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:35:27,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:35:27,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash 452468680, now seen corresponding path program 1 times [2025-02-08 05:35:27,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:27,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472740452] [2025-02-08 05:35:27,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:27,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:27,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:35:27,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:35:27,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:27,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:27,763 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:27,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:27,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472740452] [2025-02-08 05:35:27,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472740452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:27,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:27,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:35:27,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821792367] [2025-02-08 05:35:27,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:27,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:27,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:27,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:27,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:27,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 353 [2025-02-08 05:35:27,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 417 transitions, 1277 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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:27,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:27,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 353 [2025-02-08 05:35:27,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:28,124 INFO L124 PetriNetUnfolderBase]: 322/2344 cut-off events. [2025-02-08 05:35:28,125 INFO L125 PetriNetUnfolderBase]: For 156/173 co-relation queries the response was YES. [2025-02-08 05:35:28,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3352 conditions, 2344 events. 322/2344 cut-off events. For 156/173 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 18306 event pairs, 55 based on Foata normal form. 1/2160 useless extension candidates. Maximal degree in co-relation 3226. Up to 266 conditions per place. [2025-02-08 05:35:28,137 INFO L140 encePairwiseOnDemand]: 350/353 looper letters, 30 selfloop transitions, 3 changer transitions 0/425 dead transitions. [2025-02-08 05:35:28,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 425 transitions, 1359 flow [2025-02-08 05:35:28,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2025-02-08 05:35:28,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8895184135977338 [2025-02-08 05:35:28,140 INFO L175 Difference]: Start difference. First operand has 344 places, 417 transitions, 1277 flow. Second operand 3 states and 942 transitions. [2025-02-08 05:35:28,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 425 transitions, 1359 flow [2025-02-08 05:35:28,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 425 transitions, 1359 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:28,148 INFO L231 Difference]: Finished difference. Result has 347 places, 417 transitions, 1288 flow [2025-02-08 05:35:28,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1288, PETRI_PLACES=347, PETRI_TRANSITIONS=417} [2025-02-08 05:35:28,149 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, 21 predicate places. [2025-02-08 05:35:28,149 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 417 transitions, 1288 flow [2025-02-08 05:35:28,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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:28,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:28,150 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:28,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:35:28,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:35:28,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:28,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1775269033, now seen corresponding path program 1 times [2025-02-08 05:35:28,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:28,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984580533] [2025-02-08 05:35:28,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:28,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:28,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:35:28,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:35:28,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:28,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:28,319 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:28,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:28,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984580533] [2025-02-08 05:35:28,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984580533] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:35:28,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667850106] [2025-02-08 05:35:28,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:28,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:35:28,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:35:28,322 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:28,325 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:28,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:35:28,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:35:28,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:28,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:28,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:35:28,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:35:28,499 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:28,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:35:28,616 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:28,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667850106] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:35:28,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:35:28,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-08 05:35:28,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216823616] [2025-02-08 05:35:28,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:35:28,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 05:35:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:28,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 05:35:28,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:35:28,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 353 [2025-02-08 05:35:28,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 417 transitions, 1288 flow. Second operand has 18 states, 18 states have (on average 301.94444444444446) internal successors, (5435), 18 states have internal predecessors, (5435), 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:28,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:28,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 353 [2025-02-08 05:35:28,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:29,061 INFO L124 PetriNetUnfolderBase]: 288/2269 cut-off events. [2025-02-08 05:35:29,062 INFO L125 PetriNetUnfolderBase]: For 169/211 co-relation queries the response was YES. [2025-02-08 05:35:29,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3443 conditions, 2269 events. 288/2269 cut-off events. For 169/211 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17709 event pairs, 72 based on Foata normal form. 4/2115 useless extension candidates. Maximal degree in co-relation 3241. Up to 436 conditions per place. [2025-02-08 05:35:29,072 INFO L140 encePairwiseOnDemand]: 347/353 looper letters, 31 selfloop transitions, 21 changer transitions 0/435 dead transitions. [2025-02-08 05:35:29,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 435 transitions, 1480 flow [2025-02-08 05:35:29,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:35:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:35:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6356 transitions. [2025-02-08 05:35:29,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8574126534466477 [2025-02-08 05:35:29,082 INFO L175 Difference]: Start difference. First operand has 347 places, 417 transitions, 1288 flow. Second operand 21 states and 6356 transitions. [2025-02-08 05:35:29,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 435 transitions, 1480 flow [2025-02-08 05:35:29,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 435 transitions, 1474 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:35:29,089 INFO L231 Difference]: Finished difference. Result has 370 places, 430 transitions, 1412 flow [2025-02-08 05:35:29,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1412, PETRI_PLACES=370, PETRI_TRANSITIONS=430} [2025-02-08 05:35:29,090 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, 44 predicate places. [2025-02-08 05:35:29,090 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 430 transitions, 1412 flow [2025-02-08 05:35:29,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 301.94444444444446) internal successors, (5435), 18 states have internal predecessors, (5435), 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,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:29,093 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:29,099 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:29,293 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:29,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:35:29,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:29,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1937435497, now seen corresponding path program 2 times [2025-02-08 05:35:29,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:29,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729023760] [2025-02-08 05:35:29,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:35:29,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:29,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-02-08 05:35:29,328 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:29,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:35:29,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:29,581 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:29,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:29,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729023760] [2025-02-08 05:35:29,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729023760] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:35:29,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817468539] [2025-02-08 05:35:29,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:35:29,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:35:29,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:35:29,583 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:29,585 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:29,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-02-08 05:35:29,682 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:29,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:35:29,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:29,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 05:35:29,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:35:29,777 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:29,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:35:29,959 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:29,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817468539] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:35:29,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:35:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-08 05:35:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299254963] [2025-02-08 05:35:29,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:35:29,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 05:35:29,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:29,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 05:35:29,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-08 05:35:30,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 353 [2025-02-08 05:35:30,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 430 transitions, 1412 flow. Second operand has 23 states, 23 states have (on average 302.04347826086956) internal successors, (6947), 23 states have internal predecessors, (6947), 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,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:30,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 353 [2025-02-08 05:35:30,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:30,502 INFO L124 PetriNetUnfolderBase]: 288/2284 cut-off events. [2025-02-08 05:35:30,502 INFO L125 PetriNetUnfolderBase]: For 270/312 co-relation queries the response was YES. [2025-02-08 05:35:30,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3543 conditions, 2284 events. 288/2284 cut-off events. For 270/312 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17672 event pairs, 72 based on Foata normal form. 3/2129 useless extension candidates. Maximal degree in co-relation 3241. Up to 436 conditions per place. [2025-02-08 05:35:30,517 INFO L140 encePairwiseOnDemand]: 347/353 looper letters, 34 selfloop transitions, 30 changer transitions 0/447 dead transitions. [2025-02-08 05:35:30,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 447 transitions, 1668 flow [2025-02-08 05:35:30,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 05:35:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-08 05:35:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9067 transitions. [2025-02-08 05:35:30,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8561850802644003 [2025-02-08 05:35:30,530 INFO L175 Difference]: Start difference. First operand has 370 places, 430 transitions, 1412 flow. Second operand 30 states and 9067 transitions. [2025-02-08 05:35:30,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 447 transitions, 1668 flow [2025-02-08 05:35:30,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 447 transitions, 1638 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-02-08 05:35:30,539 INFO L231 Difference]: Finished difference. Result has 397 places, 440 transitions, 1540 flow [2025-02-08 05:35:30,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1540, PETRI_PLACES=397, PETRI_TRANSITIONS=440} [2025-02-08 05:35:30,542 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, 71 predicate places. [2025-02-08 05:35:30,542 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 440 transitions, 1540 flow [2025-02-08 05:35:30,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 302.04347826086956) internal successors, (6947), 23 states have internal predecessors, (6947), 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,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:30,546 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:30,556 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:30,751 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:30,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:35:30,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 86936584, now seen corresponding path program 3 times [2025-02-08 05:35:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:30,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193060180] [2025-02-08 05:35:30,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:35:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:30,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 11 equivalence classes. [2025-02-08 05:35:30,814 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:30,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 05:35:30,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:35:30,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:35:30,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 05:35:30,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 05:35:30,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:30,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:35:30,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:35:30,855 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:35:30,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-02-08 05:35:30,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-08 05:35:30,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-08 05:35:30,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:35:30,858 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-02-08 05:35:30,859 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:35:30,859 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:35:30,897 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:35:30,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 430 places, 470 transitions, 956 flow [2025-02-08 05:35:30,997 INFO L124 PetriNetUnfolderBase]: 74/779 cut-off events. [2025-02-08 05:35:30,998 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:35:31,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 779 events. 74/779 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3829 event pairs, 0 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 496. Up to 12 conditions per place. [2025-02-08 05:35:31,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 430 places, 470 transitions, 956 flow [2025-02-08 05:35:31,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 430 places, 470 transitions, 956 flow [2025-02-08 05:35:31,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:35:31,014 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;@376ca89d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:35:31,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 05:35:31,019 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:35:31,019 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-02-08 05:35:31,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:35:31,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:31,019 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:31,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-08 05:35:31,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash -44030372, now seen corresponding path program 1 times [2025-02-08 05:35:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:31,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331009604] [2025-02-08 05:35:31,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:31,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:35:31,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:35:31,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:31,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:31,056 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:31,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:31,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331009604] [2025-02-08 05:35:31,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331009604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:31,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:31,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:35:31,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492026469] [2025-02-08 05:35:31,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:31,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:31,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:31,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:31,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:31,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 470 [2025-02-08 05:35:31,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 470 transitions, 956 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 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,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:31,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 470 [2025-02-08 05:35:31,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:32,630 INFO L124 PetriNetUnfolderBase]: 1782/13248 cut-off events. [2025-02-08 05:35:32,630 INFO L125 PetriNetUnfolderBase]: For 123/127 co-relation queries the response was YES. [2025-02-08 05:35:32,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15912 conditions, 13248 events. 1782/13248 cut-off events. For 123/127 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 161605 event pairs, 1464 based on Foata normal form. 3383/15577 useless extension candidates. Maximal degree in co-relation 14120. Up to 2601 conditions per place. [2025-02-08 05:35:32,715 INFO L140 encePairwiseOnDemand]: 431/470 looper letters, 33 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2025-02-08 05:35:32,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 429 transitions, 944 flow [2025-02-08 05:35:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1263 transitions. [2025-02-08 05:35:32,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8957446808510638 [2025-02-08 05:35:32,718 INFO L175 Difference]: Start difference. First operand has 430 places, 470 transitions, 956 flow. Second operand 3 states and 1263 transitions. [2025-02-08 05:35:32,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 429 transitions, 944 flow [2025-02-08 05:35:32,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 429 transitions, 944 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:32,723 INFO L231 Difference]: Finished difference. Result has 427 places, 429 transitions, 884 flow [2025-02-08 05:35:32,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=427, PETRI_TRANSITIONS=429} [2025-02-08 05:35:32,724 INFO L279 CegarLoopForPetriNet]: 430 programPoint places, -3 predicate places. [2025-02-08 05:35:32,724 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 429 transitions, 884 flow [2025-02-08 05:35:32,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 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:32,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:32,725 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:32,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:35:32,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-08 05:35:32,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1313524613, now seen corresponding path program 1 times [2025-02-08 05:35:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:32,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40220796] [2025-02-08 05:35:32,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:32,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:32,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:35:32,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:35:32,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:32,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:32,853 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:32,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:32,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40220796] [2025-02-08 05:35:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40220796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:35:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615447788] [2025-02-08 05:35:32,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:32,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:35:32,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:35:32,859 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:32,861 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:32,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:35:32,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:35:32,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:32,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:32,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:35:32,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:35:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:35:32,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:35:32,987 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:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615447788] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:35:32,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:35:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:35:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419814243] [2025-02-08 05:35:32,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:35:32,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:35:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:32,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:35:32,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:35:33,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 470 [2025-02-08 05:35:33,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 429 transitions, 884 flow. Second operand has 10 states, 10 states have (on average 395.8) internal successors, (3958), 10 states have internal predecessors, (3958), 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,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:33,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 470 [2025-02-08 05:35:33,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:34,486 INFO L124 PetriNetUnfolderBase]: 1782/13255 cut-off events. [2025-02-08 05:35:34,486 INFO L125 PetriNetUnfolderBase]: For 124/128 co-relation queries the response was YES. [2025-02-08 05:35:34,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15938 conditions, 13255 events. 1782/13255 cut-off events. For 124/128 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 161666 event pairs, 1464 based on Foata normal form. 2/12203 useless extension candidates. Maximal degree in co-relation 15842. Up to 2601 conditions per place. [2025-02-08 05:35:34,581 INFO L140 encePairwiseOnDemand]: 464/470 looper letters, 37 selfloop transitions, 9 changer transitions 0/437 dead transitions. [2025-02-08 05:35:34,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 437 transitions, 994 flow [2025-02-08 05:35:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:35:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:35:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3594 transitions. [2025-02-08 05:35:34,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.849645390070922 [2025-02-08 05:35:34,588 INFO L175 Difference]: Start difference. First operand has 427 places, 429 transitions, 884 flow. Second operand 9 states and 3594 transitions. [2025-02-08 05:35:34,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 437 transitions, 994 flow [2025-02-08 05:35:34,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 437 transitions, 992 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:35:34,595 INFO L231 Difference]: Finished difference. Result has 437 places, 435 transitions, 932 flow [2025-02-08 05:35:34,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=932, PETRI_PLACES=437, PETRI_TRANSITIONS=435} [2025-02-08 05:35:34,596 INFO L279 CegarLoopForPetriNet]: 430 programPoint places, 7 predicate places. [2025-02-08 05:35:34,596 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 435 transitions, 932 flow [2025-02-08 05:35:34,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 395.8) internal successors, (3958), 10 states have internal predecessors, (3958), 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,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:34,597 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:34,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 05:35:34,798 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:34,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-08 05:35:34,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:34,799 INFO L85 PathProgramCache]: Analyzing trace with hash -914948635, now seen corresponding path program 2 times [2025-02-08 05:35:34,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:34,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887709691] [2025-02-08 05:35:34,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:35:34,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:34,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-02-08 05:35:34,813 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:34,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:35:34,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:35,100 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:35,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:35,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887709691] [2025-02-08 05:35:35,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887709691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:35,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:35,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:35:35,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574776717] [2025-02-08 05:35:35,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:35,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:35:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:35,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:35:35,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:35:35,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 470 [2025-02-08 05:35:35,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 435 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 326.5) internal successors, (1959), 6 states have internal predecessors, (1959), 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,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:35,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 470 [2025-02-08 05:35:35,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:58,528 INFO L124 PetriNetUnfolderBase]: 86364/212336 cut-off events. [2025-02-08 05:35:58,529 INFO L125 PetriNetUnfolderBase]: For 1319/1319 co-relation queries the response was YES. [2025-02-08 05:35:59,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340955 conditions, 212336 events. 86364/212336 cut-off events. For 1319/1319 co-relation queries the response was YES. Maximal size of possible extension queue 4017. Compared 2886208 event pairs, 59516 based on Foata normal form. 0/197124 useless extension candidates. Maximal degree in co-relation 340830. Up to 120095 conditions per place. [2025-02-08 05:35:59,957 INFO L140 encePairwiseOnDemand]: 423/470 looper letters, 170 selfloop transitions, 166 changer transitions 0/665 dead transitions. [2025-02-08 05:35:59,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 665 transitions, 2069 flow [2025-02-08 05:35:59,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:35:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:35:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2287 transitions. [2025-02-08 05:35:59,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8109929078014184 [2025-02-08 05:35:59,960 INFO L175 Difference]: Start difference. First operand has 437 places, 435 transitions, 932 flow. Second operand 6 states and 2287 transitions. [2025-02-08 05:35:59,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 665 transitions, 2069 flow [2025-02-08 05:35:59,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 665 transitions, 2063 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 05:35:59,978 INFO L231 Difference]: Finished difference. Result has 446 places, 600 transitions, 2012 flow [2025-02-08 05:35:59,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2012, PETRI_PLACES=446, PETRI_TRANSITIONS=600} [2025-02-08 05:35:59,980 INFO L279 CegarLoopForPetriNet]: 430 programPoint places, 16 predicate places. [2025-02-08 05:35:59,980 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 600 transitions, 2012 flow [2025-02-08 05:35:59,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 326.5) internal successors, (1959), 6 states have internal predecessors, (1959), 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:59,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:59,981 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] [2025-02-08 05:35:59,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:35:59,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-08 05:35:59,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:59,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1864683272, now seen corresponding path program 1 times [2025-02-08 05:35:59,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:59,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796048396] [2025-02-08 05:35:59,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:59,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:59,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:35:59,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:35:59,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:59,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:00,032 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:36:00,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:00,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796048396] [2025-02-08 05:36:00,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796048396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:00,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:00,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:36:00,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263616164] [2025-02-08 05:36:00,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:00,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:00,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:00,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:00,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 470 [2025-02-08 05:36:00,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 600 transitions, 2012 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 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:36:00,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:00,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 470 [2025-02-08 05:36:00,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand