./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 c00e63dc 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-?-c00e63d-m [2025-02-06 09:26:15,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:26:15,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:26:15,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:26:15,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:26:15,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:26:15,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:26:15,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:26:15,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:26:15,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:26:15,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:26:15,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:26:15,923 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:26:15,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:26:15,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:26:15,923 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:26:15,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:26:15,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:26:15,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:26:15,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:26:15,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:26:15,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:26:15,924 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:26:15,924 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:26:15,924 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:26:15,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:26:15,924 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:26:15,924 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:26:15,924 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:26:15,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:26:15,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:26:15,925 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-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-06 09:26:16,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:26:16,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:26:16,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:26:16,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:26:16,158 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:26:16,159 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-06 09:26:17,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29ec11af7/698b295b70f4425e8d161281b47d4840/FLAG942cfaa67 [2025-02-06 09:26:17,612 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:26:17,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-02-06 09:26:17,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29ec11af7/698b295b70f4425e8d161281b47d4840/FLAG942cfaa67 [2025-02-06 09:26:17,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29ec11af7/698b295b70f4425e8d161281b47d4840 [2025-02-06 09:26:17,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:26:17,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:26:17,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:26:17,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:26:17,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:26:17,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:26:17" (1/1) ... [2025-02-06 09:26:17,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2427776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:17, skipping insertion in model container [2025-02-06 09:26:17,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:26:17" (1/1) ... [2025-02-06 09:26:17,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:26:18,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:26:18,205 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:26:18,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:26:18,299 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:26:18,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18 WrapperNode [2025-02-06 09:26:18,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:26:18,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:26:18,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:26:18,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:26:18,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (1/1) ... [2025-02-06 09:26:18,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (1/1) ... [2025-02-06 09:26:18,336 INFO L138 Inliner]: procedures = 272, calls = 96, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 325 [2025-02-06 09:26:18,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:26:18,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:26:18,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:26:18,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:26:18,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (1/1) ... [2025-02-06 09:26:18,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (1/1) ... [2025-02-06 09:26:18,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (1/1) ... [2025-02-06 09:26:18,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (1/1) ... [2025-02-06 09:26:18,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (1/1) ... [2025-02-06 09:26:18,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (1/1) ... [2025-02-06 09:26:18,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (1/1) ... [2025-02-06 09:26:18,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (1/1) ... [2025-02-06 09:26:18,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:26:18,371 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:26:18,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:26:18,375 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:26:18,376 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (1/1) ... [2025-02-06 09:26:18,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:26:18,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:18,412 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-06 09:26:18,414 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-06 09:26:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:26:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:26:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:26:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:26:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:26:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:26:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:26:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:26:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:26:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:26:18,432 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:26:18,535 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:26:18,537 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:26:18,848 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:26:18,849 INFO L1309 $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-06 09:26:18,972 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:26:18,973 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:26:18,996 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:26:19,000 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:26:19,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:26:19 BoogieIcfgContainer [2025-02-06 09:26:19,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:26:19,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:26:19,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:26:19,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:26:19,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:26:17" (1/3) ... [2025-02-06 09:26:19,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d3c226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:26:19, skipping insertion in model container [2025-02-06 09:26:19,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:18" (2/3) ... [2025-02-06 09:26:19,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d3c226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:26:19, skipping insertion in model container [2025-02-06 09:26:19,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:26:19" (3/3) ... [2025-02-06 09:26:19,006 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-02-06 09:26:19,015 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:26:19,016 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-06 09:26:19,017 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:26:19,089 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:26:19,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 326 places, 353 transitions, 713 flow [2025-02-06 09:26:19,233 INFO L124 PetriNetUnfolderBase]: 44/494 cut-off events. [2025-02-06 09:26:19,235 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:26:19,243 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 1918 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-06 09:26:19,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 326 places, 353 transitions, 713 flow [2025-02-06 09:26:19,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 326 places, 353 transitions, 713 flow [2025-02-06 09:26:19,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:19,268 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;@6a39a9b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:19,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-06 09:26:19,287 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:19,287 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-02-06 09:26:19,287 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:19,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:19,288 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-06 09:26:19,288 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-06 09:26:19,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1630305057, now seen corresponding path program 1 times [2025-02-06 09:26:19,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:19,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104768167] [2025-02-06 09:26:19,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:19,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:26:19,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:26:19,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:19,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:19,632 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-06 09:26:19,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:19,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104768167] [2025-02-06 09:26:19,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104768167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:19,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:19,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:19,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744198644] [2025-02-06 09:26:19,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:19,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:19,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:19,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:19,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:19,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 353 [2025-02-06 09:26:19,690 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-06 09:26:19,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:19,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 353 [2025-02-06 09:26:19,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:19,941 INFO L124 PetriNetUnfolderBase]: 98/1419 cut-off events. [2025-02-06 09:26:19,941 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-06 09:26:19,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 1419 events. 98/1419 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9264 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-06 09:26:19,956 INFO L140 encePairwiseOnDemand]: 326/353 looper letters, 23 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2025-02-06 09:26:19,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 326 transitions, 709 flow [2025-02-06 09:26:19,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2025-02-06 09:26:19,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055712936732767 [2025-02-06 09:26:19,974 INFO L175 Difference]: Start difference. First operand has 326 places, 353 transitions, 713 flow. Second operand 3 states and 959 transitions. [2025-02-06 09:26:19,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 326 transitions, 709 flow [2025-02-06 09:26:19,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 326 transitions, 709 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:26:19,986 INFO L231 Difference]: Finished difference. Result has 325 places, 326 transitions, 669 flow [2025-02-06 09:26:19,988 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-06 09:26:19,994 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -1 predicate places. [2025-02-06 09:26:19,994 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 326 transitions, 669 flow [2025-02-06 09:26:19,995 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-06 09:26:19,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:19,995 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-06 09:26:19,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:26:19,995 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-06 09:26:19,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1348948319, now seen corresponding path program 1 times [2025-02-06 09:26:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496985849] [2025-02-06 09:26:19,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:20,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:26:20,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:26:20,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:20,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:20,214 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-06 09:26:20,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:20,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496985849] [2025-02-06 09:26:20,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496985849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:26:20,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917306424] [2025-02-06 09:26:20,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:20,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:26:20,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:20,217 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-06 09:26:20,219 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-06 09:26:20,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:26:20,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:26:20,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:20,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:20,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:26:20,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:26:20,380 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-06 09:26:20,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:26:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:20,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917306424] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:26:20,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:26:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:26:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657538436] [2025-02-06 09:26:20,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:26:20,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:26:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:20,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:26:20,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:26:20,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 353 [2025-02-06 09:26:20,460 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-06 09:26:20,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:20,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 353 [2025-02-06 09:26:20,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:20,763 INFO L124 PetriNetUnfolderBase]: 98/1426 cut-off events. [2025-02-06 09:26:20,764 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-06 09:26:20,768 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 9264 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-06 09:26:20,773 INFO L140 encePairwiseOnDemand]: 347/353 looper letters, 27 selfloop transitions, 9 changer transitions 0/334 dead transitions. [2025-02-06 09:26:20,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 334 transitions, 759 flow [2025-02-06 09:26:20,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:26:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:26:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2738 transitions. [2025-02-06 09:26:20,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8618193264085615 [2025-02-06 09:26:20,783 INFO L175 Difference]: Start difference. First operand has 325 places, 326 transitions, 669 flow. Second operand 9 states and 2738 transitions. [2025-02-06 09:26:20,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 334 transitions, 759 flow [2025-02-06 09:26:20,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 334 transitions, 757 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:26:20,791 INFO L231 Difference]: Finished difference. Result has 335 places, 332 transitions, 717 flow [2025-02-06 09:26:20,792 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-06 09:26:20,793 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, 9 predicate places. [2025-02-06 09:26:20,793 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 332 transitions, 717 flow [2025-02-06 09:26:20,794 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-06 09:26:20,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:20,795 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-06 09:26:20,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:26:20,997 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-06 09:26:20,997 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-06 09:26:20,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:20,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1616740703, now seen corresponding path program 2 times [2025-02-06 09:26:20,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:20,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715060201] [2025-02-06 09:26:20,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:26:20,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:21,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-02-06 09:26:21,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-02-06 09:26:21,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:26:21,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:21,534 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-06 09:26:21,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:21,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715060201] [2025-02-06 09:26:21,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715060201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:21,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:21,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:21,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200872585] [2025-02-06 09:26:21,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:21,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:21,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:21,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:21,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 353 [2025-02-06 09:26:21,901 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-06 09:26:21,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:21,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 353 [2025-02-06 09:26:21,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:22,711 INFO L124 PetriNetUnfolderBase]: 1447/5995 cut-off events. [2025-02-06 09:26:22,712 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 09:26:22,724 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 55042 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-06 09:26:22,744 INFO L140 encePairwiseOnDemand]: 326/353 looper letters, 107 selfloop transitions, 86 changer transitions 0/449 dead transitions. [2025-02-06 09:26:22,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 449 transitions, 1337 flow [2025-02-06 09:26:22,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:26:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:26:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1700 transitions. [2025-02-06 09:26:22,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8026440037771483 [2025-02-06 09:26:22,748 INFO L175 Difference]: Start difference. First operand has 335 places, 332 transitions, 717 flow. Second operand 6 states and 1700 transitions. [2025-02-06 09:26:22,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 449 transitions, 1337 flow [2025-02-06 09:26:22,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 449 transitions, 1331 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:26:22,812 INFO L231 Difference]: Finished difference. Result has 344 places, 417 transitions, 1277 flow [2025-02-06 09:26:22,813 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-06 09:26:22,814 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, 18 predicate places. [2025-02-06 09:26:22,815 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 417 transitions, 1277 flow [2025-02-06 09:26:22,815 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-06 09:26:22,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:22,816 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-06 09:26:22,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:26:22,816 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-06 09:26:22,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1990186909, now seen corresponding path program 1 times [2025-02-06 09:26:22,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:22,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583466364] [2025-02-06 09:26:22,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:22,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:22,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 09:26:22,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 09:26:22,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:22,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:22,882 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-06 09:26:22,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:22,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583466364] [2025-02-06 09:26:22,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583466364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:22,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:22,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:22,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657831061] [2025-02-06 09:26:22,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:22,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:22,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:22,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:22,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:22,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 353 [2025-02-06 09:26:22,904 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-06 09:26:22,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:22,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 353 [2025-02-06 09:26:22,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:23,134 INFO L124 PetriNetUnfolderBase]: 322/2341 cut-off events. [2025-02-06 09:26:23,134 INFO L125 PetriNetUnfolderBase]: For 159/178 co-relation queries the response was YES. [2025-02-06 09:26:23,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3346 conditions, 2341 events. 322/2341 cut-off events. For 159/178 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 18353 event pairs, 55 based on Foata normal form. 1/2157 useless extension candidates. Maximal degree in co-relation 3220. Up to 266 conditions per place. [2025-02-06 09:26:23,148 INFO L140 encePairwiseOnDemand]: 350/353 looper letters, 30 selfloop transitions, 3 changer transitions 0/425 dead transitions. [2025-02-06 09:26:23,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 425 transitions, 1359 flow [2025-02-06 09:26:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2025-02-06 09:26:23,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8895184135977338 [2025-02-06 09:26:23,150 INFO L175 Difference]: Start difference. First operand has 344 places, 417 transitions, 1277 flow. Second operand 3 states and 942 transitions. [2025-02-06 09:26:23,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 425 transitions, 1359 flow [2025-02-06 09:26:23,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 425 transitions, 1359 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:26:23,158 INFO L231 Difference]: Finished difference. Result has 347 places, 417 transitions, 1288 flow [2025-02-06 09:26:23,159 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-06 09:26:23,159 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, 21 predicate places. [2025-02-06 09:26:23,159 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 417 transitions, 1288 flow [2025-02-06 09:26:23,160 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-06 09:26:23,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:23,160 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-06 09:26:23,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:26:23,160 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-06 09:26:23,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1445457714, now seen corresponding path program 1 times [2025-02-06 09:26:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:23,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381031684] [2025-02-06 09:26:23,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:23,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 09:26:23,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 09:26:23,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:23,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:23,332 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-06 09:26:23,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:23,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381031684] [2025-02-06 09:26:23,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381031684] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:26:23,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139867966] [2025-02-06 09:26:23,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:23,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:26:23,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:23,335 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-06 09:26:23,337 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-06 09:26:23,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 09:26:23,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 09:26:23,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:23,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:23,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:26:23,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:26:23,465 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-06 09:26:23,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:26:23,549 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-06 09:26:23,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139867966] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:26:23,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:26:23,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 09:26:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64438746] [2025-02-06 09:26:23,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:26:23,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 09:26:23,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:23,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 09:26:23,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 09:26:23,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 353 [2025-02-06 09:26:23,591 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-06 09:26:23,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:23,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 353 [2025-02-06 09:26:23,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:24,018 INFO L124 PetriNetUnfolderBase]: 267/2245 cut-off events. [2025-02-06 09:26:24,019 INFO L125 PetriNetUnfolderBase]: For 172/216 co-relation queries the response was YES. [2025-02-06 09:26:24,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3395 conditions, 2245 events. 267/2245 cut-off events. For 172/216 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17593 event pairs, 72 based on Foata normal form. 4/2091 useless extension candidates. Maximal degree in co-relation 3193. Up to 436 conditions per place. [2025-02-06 09:26:24,033 INFO L140 encePairwiseOnDemand]: 347/353 looper letters, 31 selfloop transitions, 21 changer transitions 0/435 dead transitions. [2025-02-06 09:26:24,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 435 transitions, 1480 flow [2025-02-06 09:26:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:26:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 09:26:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6356 transitions. [2025-02-06 09:26:24,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8574126534466477 [2025-02-06 09:26:24,045 INFO L175 Difference]: Start difference. First operand has 347 places, 417 transitions, 1288 flow. Second operand 21 states and 6356 transitions. [2025-02-06 09:26:24,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 435 transitions, 1480 flow [2025-02-06 09:26:24,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 435 transitions, 1474 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:24,053 INFO L231 Difference]: Finished difference. Result has 370 places, 430 transitions, 1412 flow [2025-02-06 09:26:24,053 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-06 09:26:24,054 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, 44 predicate places. [2025-02-06 09:26:24,054 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 430 transitions, 1412 flow [2025-02-06 09:26:24,057 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-06 09:26:24,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:24,057 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-06 09:26:24,064 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-06 09:26:24,257 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-06 09:26:24,258 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-06 09:26:24,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:24,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1324109618, now seen corresponding path program 2 times [2025-02-06 09:26:24,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:24,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692344924] [2025-02-06 09:26:24,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:26:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:24,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-02-06 09:26:24,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 09:26:24,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:26:24,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:24,608 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-06 09:26:24,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:24,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692344924] [2025-02-06 09:26:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692344924] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:26:24,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360453377] [2025-02-06 09:26:24,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:26:24,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:26:24,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:24,610 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-06 09:26:24,612 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-06 09:26:24,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-02-06 09:26:24,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 09:26:24,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:26:24,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:24,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:26:24,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:26:24,787 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-06 09:26:24,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:26:24,981 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-06 09:26:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360453377] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:26:24,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:26:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-06 09:26:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704476649] [2025-02-06 09:26:24,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:26:24,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:26:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:24,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:26:24,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:26:25,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 353 [2025-02-06 09:26:25,022 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-06 09:26:25,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:25,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 353 [2025-02-06 09:26:25,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:25,535 INFO L124 PetriNetUnfolderBase]: 267/2260 cut-off events. [2025-02-06 09:26:25,535 INFO L125 PetriNetUnfolderBase]: For 273/317 co-relation queries the response was YES. [2025-02-06 09:26:25,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3495 conditions, 2260 events. 267/2260 cut-off events. For 273/317 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17636 event pairs, 72 based on Foata normal form. 3/2105 useless extension candidates. Maximal degree in co-relation 3193. Up to 436 conditions per place. [2025-02-06 09:26:25,547 INFO L140 encePairwiseOnDemand]: 347/353 looper letters, 34 selfloop transitions, 30 changer transitions 0/447 dead transitions. [2025-02-06 09:26:25,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 447 transitions, 1668 flow [2025-02-06 09:26:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 09:26:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 09:26:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9067 transitions. [2025-02-06 09:26:25,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8561850802644003 [2025-02-06 09:26:25,559 INFO L175 Difference]: Start difference. First operand has 370 places, 430 transitions, 1412 flow. Second operand 30 states and 9067 transitions. [2025-02-06 09:26:25,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 447 transitions, 1668 flow [2025-02-06 09:26:25,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 447 transitions, 1638 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-02-06 09:26:25,568 INFO L231 Difference]: Finished difference. Result has 397 places, 440 transitions, 1540 flow [2025-02-06 09:26:25,571 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-06 09:26:25,571 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, 71 predicate places. [2025-02-06 09:26:25,571 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 440 transitions, 1540 flow [2025-02-06 09:26:25,574 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-06 09:26:25,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:25,575 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-06 09:26:25,582 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-06 09:26:25,775 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-06 09:26:25,776 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-06 09:26:25,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash 717910706, now seen corresponding path program 3 times [2025-02-06 09:26:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729082653] [2025-02-06 09:26:25,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:26:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:25,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 11 equivalence classes. [2025-02-06 09:26:25,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 09:26:25,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 09:26:25,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:25,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:26:25,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 09:26:25,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 09:26:25,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:25,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:25,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:26:25,889 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:26:25,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-06 09:26:25,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-06 09:26:25,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:26:25,892 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-02-06 09:26:25,896 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:26:25,896 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:26:25,934 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:26:25,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 430 places, 470 transitions, 956 flow [2025-02-06 09:26:26,009 INFO L124 PetriNetUnfolderBase]: 74/779 cut-off events. [2025-02-06 09:26:26,010 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:26:26,016 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 3846 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-06 09:26:26,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 430 places, 470 transitions, 956 flow [2025-02-06 09:26:26,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 430 places, 470 transitions, 956 flow [2025-02-06 09:26:26,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:26,023 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;@6a39a9b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:26,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-06 09:26:26,028 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:26,028 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-02-06 09:26:26,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:26,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:26,028 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-06 09:26:26,028 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-06 09:26:26,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1030074761, now seen corresponding path program 1 times [2025-02-06 09:26:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:26,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362794536] [2025-02-06 09:26:26,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:26,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:26:26,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:26:26,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:26,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:26,058 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-06 09:26:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362794536] [2025-02-06 09:26:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362794536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:26,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:26,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548025041] [2025-02-06 09:26:26,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:26,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:26,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:26,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:26,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:26,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 470 [2025-02-06 09:26:26,069 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-06 09:26:26,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:26,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 470 [2025-02-06 09:26:26,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:27,508 INFO L124 PetriNetUnfolderBase]: 1782/13248 cut-off events. [2025-02-06 09:26:27,508 INFO L125 PetriNetUnfolderBase]: For 121/125 co-relation queries the response was YES. [2025-02-06 09:26:27,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15912 conditions, 13248 events. 1782/13248 cut-off events. For 121/125 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 161604 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-06 09:26:27,588 INFO L140 encePairwiseOnDemand]: 431/470 looper letters, 33 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2025-02-06 09:26:27,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 429 transitions, 944 flow [2025-02-06 09:26:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1263 transitions. [2025-02-06 09:26:27,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8957446808510638 [2025-02-06 09:26:27,592 INFO L175 Difference]: Start difference. First operand has 430 places, 470 transitions, 956 flow. Second operand 3 states and 1263 transitions. [2025-02-06 09:26:27,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 429 transitions, 944 flow [2025-02-06 09:26:27,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 429 transitions, 944 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:26:27,597 INFO L231 Difference]: Finished difference. Result has 427 places, 429 transitions, 884 flow [2025-02-06 09:26:27,598 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-06 09:26:27,598 INFO L279 CegarLoopForPetriNet]: 430 programPoint places, -3 predicate places. [2025-02-06 09:26:27,598 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 429 transitions, 884 flow [2025-02-06 09:26:27,599 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-06 09:26:27,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:27,599 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-06 09:26:27,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:26:27,599 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-06 09:26:27,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash -430740127, now seen corresponding path program 1 times [2025-02-06 09:26:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:27,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433086003] [2025-02-06 09:26:27,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:27,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:27,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:26:27,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:26:27,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:27,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:27,674 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-06 09:26:27,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:27,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433086003] [2025-02-06 09:26:27,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433086003] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:26:27,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159423329] [2025-02-06 09:26:27,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:27,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:26:27,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:27,676 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-06 09:26:27,678 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-06 09:26:27,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:26:27,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:26:27,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:27,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:27,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:26:27,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:26:27,776 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-06 09:26:27,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:26:27,803 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-06 09:26:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159423329] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:26:27,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:26:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:26:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654164283] [2025-02-06 09:26:27,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:26:27,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:26:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:27,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:26:27,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:26:27,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 470 [2025-02-06 09:26:27,835 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-06 09:26:27,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:27,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 470 [2025-02-06 09:26:27,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:29,278 INFO L124 PetriNetUnfolderBase]: 1782/13255 cut-off events. [2025-02-06 09:26:29,279 INFO L125 PetriNetUnfolderBase]: For 124/128 co-relation queries the response was YES. [2025-02-06 09:26:29,319 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 161704 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-06 09:26:29,346 INFO L140 encePairwiseOnDemand]: 464/470 looper letters, 37 selfloop transitions, 9 changer transitions 0/437 dead transitions. [2025-02-06 09:26:29,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 437 transitions, 994 flow [2025-02-06 09:26:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:26:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:26:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3594 transitions. [2025-02-06 09:26:29,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.849645390070922 [2025-02-06 09:26:29,350 INFO L175 Difference]: Start difference. First operand has 427 places, 429 transitions, 884 flow. Second operand 9 states and 3594 transitions. [2025-02-06 09:26:29,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 437 transitions, 994 flow [2025-02-06 09:26:29,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 437 transitions, 992 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:26:29,355 INFO L231 Difference]: Finished difference. Result has 437 places, 435 transitions, 932 flow [2025-02-06 09:26:29,355 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-06 09:26:29,356 INFO L279 CegarLoopForPetriNet]: 430 programPoint places, 7 predicate places. [2025-02-06 09:26:29,356 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 435 transitions, 932 flow [2025-02-06 09:26:29,357 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-06 09:26:29,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:29,357 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-06 09:26:29,363 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-06 09:26:29,557 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-06 09:26:29,558 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-06 09:26:29,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1700926241, now seen corresponding path program 2 times [2025-02-06 09:26:29,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:29,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924895764] [2025-02-06 09:26:29,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:26:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:29,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-02-06 09:26:29,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-02-06 09:26:29,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:26:29,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:29,767 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-06 09:26:29,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:29,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924895764] [2025-02-06 09:26:29,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924895764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:29,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:29,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:29,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227999390] [2025-02-06 09:26:29,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:29,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:29,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:29,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:30,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 470 [2025-02-06 09:26:30,033 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-06 09:26:30,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:30,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 470 [2025-02-06 09:26:30,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:52,090 INFO L124 PetriNetUnfolderBase]: 86364/212336 cut-off events. [2025-02-06 09:26:52,091 INFO L125 PetriNetUnfolderBase]: For 1319/1319 co-relation queries the response was YES. [2025-02-06 09:26:52,852 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 2887393 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-06 09:26:53,466 INFO L140 encePairwiseOnDemand]: 423/470 looper letters, 170 selfloop transitions, 166 changer transitions 0/665 dead transitions. [2025-02-06 09:26:53,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 665 transitions, 2069 flow [2025-02-06 09:26:53,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:26:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:26:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2287 transitions. [2025-02-06 09:26:53,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8109929078014184 [2025-02-06 09:26:53,469 INFO L175 Difference]: Start difference. First operand has 437 places, 435 transitions, 932 flow. Second operand 6 states and 2287 transitions. [2025-02-06 09:26:53,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 665 transitions, 2069 flow [2025-02-06 09:26:53,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 665 transitions, 2063 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:26:53,482 INFO L231 Difference]: Finished difference. Result has 446 places, 600 transitions, 2012 flow [2025-02-06 09:26:53,483 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-06 09:26:53,483 INFO L279 CegarLoopForPetriNet]: 430 programPoint places, 16 predicate places. [2025-02-06 09:26:53,483 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 600 transitions, 2012 flow [2025-02-06 09:26:53,484 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-06 09:26:53,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:53,484 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-06 09:26:53,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:26:53,485 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-06 09:26:53,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash -577972317, now seen corresponding path program 1 times [2025-02-06 09:26:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800375765] [2025-02-06 09:26:53,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:53,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 09:26:53,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 09:26:53,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:53,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:53,524 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-06 09:26:53,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:53,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800375765] [2025-02-06 09:26:53,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800375765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:53,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:53,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479055988] [2025-02-06 09:26:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:53,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:53,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:53,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:53,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 470 [2025-02-06 09:26:53,541 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-06 09:26:53,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:53,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 470 [2025-02-06 09:26:53,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand