./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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_76-tricky_address3_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 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:28:15,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:28:15,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:28:15,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:28:15,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:28:15,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:28:15,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:28:15,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:28:15,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:28:15,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:28:15,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:28:15,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:28:15,891 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:28:15,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:28:15,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:15,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:28:15,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:28:15,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:15,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:28:15,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:28:15,893 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:28:15,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:28:15,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:28:15,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:28:15,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:28:15,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:28:15,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:28:15,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:28:15,893 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 -> 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 [2025-01-09 21:28:16,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:28:16,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:28:16,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:28:16,136 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:28:16,136 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:28:16,137 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_76-tricky_address3_racefree.i [2025-01-09 21:28:17,271 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c352f2169/e64ccfa65bc84007aba962799c64f8a9/FLAG183cb5fe2 [2025-01-09 21:28:17,623 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:28:17,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2025-01-09 21:28:17,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c352f2169/e64ccfa65bc84007aba962799c64f8a9/FLAG183cb5fe2 [2025-01-09 21:28:17,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c352f2169/e64ccfa65bc84007aba962799c64f8a9 [2025-01-09 21:28:17,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:28:17,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:28:17,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:28:17,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:28:17,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:28:17,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:28:17" (1/1) ... [2025-01-09 21:28:17,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3afbe61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:17, skipping insertion in model container [2025-01-09 21:28:17,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:28:17" (1/1) ... [2025-01-09 21:28:17,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:28:18,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:28:18,140 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:28:18,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:28:18,221 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:28:18,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18 WrapperNode [2025-01-09 21:28:18,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:28:18,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:28:18,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:28:18,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:28:18,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,275 INFO L138 Inliner]: procedures = 271, calls = 110, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 329 [2025-01-09 21:28:18,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:28:18,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:28:18,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:28:18,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:28:18,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:28:18,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:28:18,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:28:18,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:28:18,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (1/1) ... [2025-01-09 21:28:18,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:18,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:18,355 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-01-09 21:28:18,357 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-01-09 21:28:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:28:18,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:28:18,376 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:28:18,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:28:18,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:28:18,376 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:28:18,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:28:18,376 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:28:18,376 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:28:18,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:28:18,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:28:18,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:28:18,378 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:28:18,482 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:28:18,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:28:18,888 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:28:18,889 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:28:18,923 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:28:18,923 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-09 21:28:18,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:28:18 BoogieIcfgContainer [2025-01-09 21:28:18,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:28:18,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:28:18,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:28:18,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:28:18,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:28:17" (1/3) ... [2025-01-09 21:28:18,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a52e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:28:18, skipping insertion in model container [2025-01-09 21:28:18,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:18" (2/3) ... [2025-01-09 21:28:18,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a52e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:28:18, skipping insertion in model container [2025-01-09 21:28:18,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:28:18" (3/3) ... [2025-01-09 21:28:18,929 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2025-01-09 21:28:18,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:28:18,940 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_76-tricky_address3_racefree.i that has 2 procedures, 321 locations, 1 initial locations, 13 loop locations, and 12 error locations. [2025-01-09 21:28:18,940 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:28:19,018 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:28:19,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 324 places, 351 transitions, 709 flow [2025-01-09 21:28:19,187 INFO L124 PetriNetUnfolderBase]: 43/478 cut-off events. [2025-01-09 21:28:19,190 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:28:19,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 478 events. 43/478 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1663 event pairs, 0 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 246. Up to 8 conditions per place. [2025-01-09 21:28:19,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 324 places, 351 transitions, 709 flow [2025-01-09 21:28:19,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 324 places, 351 transitions, 709 flow [2025-01-09 21:28:19,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:19,228 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;@5e352e36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:19,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-09 21:28:19,247 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:19,248 INFO L124 PetriNetUnfolderBase]: 5/135 cut-off events. [2025-01-09 21:28:19,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:19,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:19,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:19,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:19,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:19,253 INFO L85 PathProgramCache]: Analyzing trace with hash -817548493, now seen corresponding path program 1 times [2025-01-09 21:28:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802742011] [2025-01-09 21:28:19,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:19,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:19,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:28:19,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:28:19,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:19,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:19,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802742011] [2025-01-09 21:28:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802742011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:19,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:19,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:19,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442980354] [2025-01-09 21:28:19,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:19,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:19,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:19,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:19,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:19,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 351 [2025-01-09 21:28:19,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 351 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 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-01-09 21:28:19,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:19,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 351 [2025-01-09 21:28:19,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:19,872 INFO L124 PetriNetUnfolderBase]: 85/1310 cut-off events. [2025-01-09 21:28:19,872 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:28:19,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1310 events. 85/1310 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8302 event pairs, 72 based on Foata normal form. 185/1379 useless extension candidates. Maximal degree in co-relation 1250. Up to 178 conditions per place. [2025-01-09 21:28:19,883 INFO L140 encePairwiseOnDemand]: 322/351 looper letters, 23 selfloop transitions, 2 changer transitions 1/322 dead transitions. [2025-01-09 21:28:19,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 322 transitions, 701 flow [2025-01-09 21:28:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 949 transitions. [2025-01-09 21:28:19,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9012345679012346 [2025-01-09 21:28:19,902 INFO L175 Difference]: Start difference. First operand has 324 places, 351 transitions, 709 flow. Second operand 3 states and 949 transitions. [2025-01-09 21:28:19,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 322 transitions, 701 flow [2025-01-09 21:28:19,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 322 transitions, 701 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:19,916 INFO L231 Difference]: Finished difference. Result has 323 places, 321 transitions, 659 flow [2025-01-09 21:28:19,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=323, PETRI_TRANSITIONS=321} [2025-01-09 21:28:19,920 INFO L279 CegarLoopForPetriNet]: 324 programPoint places, -1 predicate places. [2025-01-09 21:28:19,921 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 321 transitions, 659 flow [2025-01-09 21:28:19,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 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-01-09 21:28:19,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:19,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:19,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:28:19,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:19,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:19,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1219735419, now seen corresponding path program 1 times [2025-01-09 21:28:19,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:19,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904672355] [2025-01-09 21:28:19,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:19,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:19,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:28:19,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:28:19,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:19,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:20,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:20,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904672355] [2025-01-09 21:28:20,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904672355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:28:20,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793046638] [2025-01-09 21:28:20,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:20,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:28:20,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:20,163 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-01-09 21:28:20,164 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-01-09 21:28:20,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:28:20,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:28:20,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:20,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:20,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:28:20,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:28:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:20,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:28:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:20,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793046638] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:28:20,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:28:20,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:28:20,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760686838] [2025-01-09 21:28:20,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:28:20,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:28:20,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:20,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:28:20,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:28:20,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 351 [2025-01-09 21:28:20,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 321 transitions, 659 flow. Second operand has 10 states, 10 states have (on average 297.8) internal successors, (2978), 10 states have internal predecessors, (2978), 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-01-09 21:28:20,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:20,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 351 [2025-01-09 21:28:20,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:20,673 INFO L124 PetriNetUnfolderBase]: 85/1316 cut-off events. [2025-01-09 21:28:20,673 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:28:20,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 1316 events. 85/1316 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8302 event pairs, 72 based on Foata normal form. 2/1203 useless extension candidates. Maximal degree in co-relation 1424. Up to 178 conditions per place. [2025-01-09 21:28:20,679 INFO L140 encePairwiseOnDemand]: 345/351 looper letters, 27 selfloop transitions, 9 changer transitions 0/329 dead transitions. [2025-01-09 21:28:20,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 329 transitions, 749 flow [2025-01-09 21:28:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:28:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:28:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2702 transitions. [2025-01-09 21:28:20,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8553339664450775 [2025-01-09 21:28:20,684 INFO L175 Difference]: Start difference. First operand has 323 places, 321 transitions, 659 flow. Second operand 9 states and 2702 transitions. [2025-01-09 21:28:20,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 329 transitions, 749 flow [2025-01-09 21:28:20,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 329 transitions, 747 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:20,690 INFO L231 Difference]: Finished difference. Result has 332 places, 327 transitions, 707 flow [2025-01-09 21:28:20,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=707, PETRI_PLACES=332, PETRI_TRANSITIONS=327} [2025-01-09 21:28:20,692 INFO L279 CegarLoopForPetriNet]: 324 programPoint places, 8 predicate places. [2025-01-09 21:28:20,692 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 327 transitions, 707 flow [2025-01-09 21:28:20,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 297.8) internal successors, (2978), 10 states have internal predecessors, (2978), 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-01-09 21:28:20,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:20,694 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:20,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:28:20,899 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-01-09 21:28:20,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:20,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:20,900 INFO L85 PathProgramCache]: Analyzing trace with hash 686085445, now seen corresponding path program 2 times [2025-01-09 21:28:20,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:20,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080093066] [2025-01-09 21:28:20,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:28:20,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:20,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-01-09 21:28:20,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 117 statements. [2025-01-09 21:28:20,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:28:20,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:28:21,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:21,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080093066] [2025-01-09 21:28:21,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080093066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:21,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:21,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654816954] [2025-01-09 21:28:21,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:21,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:21,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:21,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:21,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:21,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 351 [2025-01-09 21:28:21,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 327 transitions, 707 flow. Second operand has 6 states, 6 states have (on average 248.5) internal successors, (1491), 6 states have internal predecessors, (1491), 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-01-09 21:28:21,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:21,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 351 [2025-01-09 21:28:21,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:22,698 INFO L124 PetriNetUnfolderBase]: 1365/5261 cut-off events. [2025-01-09 21:28:22,699 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:28:22,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8057 conditions, 5261 events. 1365/5261 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 46610 event pairs, 929 based on Foata normal form. 0/4850 useless extension candidates. Maximal degree in co-relation 7933. Up to 2543 conditions per place. [2025-01-09 21:28:22,719 INFO L140 encePairwiseOnDemand]: 324/351 looper letters, 107 selfloop transitions, 86 changer transitions 0/444 dead transitions. [2025-01-09 21:28:22,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 444 transitions, 1327 flow [2025-01-09 21:28:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1676 transitions. [2025-01-09 21:28:22,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7958214624881291 [2025-01-09 21:28:22,723 INFO L175 Difference]: Start difference. First operand has 332 places, 327 transitions, 707 flow. Second operand 6 states and 1676 transitions. [2025-01-09 21:28:22,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 444 transitions, 1327 flow [2025-01-09 21:28:22,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 444 transitions, 1321 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:22,732 INFO L231 Difference]: Finished difference. Result has 341 places, 412 transitions, 1267 flow [2025-01-09 21:28:22,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1267, PETRI_PLACES=341, PETRI_TRANSITIONS=412} [2025-01-09 21:28:22,734 INFO L279 CegarLoopForPetriNet]: 324 programPoint places, 17 predicate places. [2025-01-09 21:28:22,734 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 412 transitions, 1267 flow [2025-01-09 21:28:22,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 248.5) internal successors, (1491), 6 states have internal predecessors, (1491), 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-01-09 21:28:22,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:22,736 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:22,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:28:22,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:22,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1769634591, now seen corresponding path program 1 times [2025-01-09 21:28:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:22,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258552012] [2025-01-09 21:28:22,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:22,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:22,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:28:22,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:28:22,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:22,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:28:22,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:22,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258552012] [2025-01-09 21:28:22,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258552012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:22,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:22,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:22,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619746091] [2025-01-09 21:28:22,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:22,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:22,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:22,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:22,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:22,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 351 [2025-01-09 21:28:22,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 412 transitions, 1267 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 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-01-09 21:28:22,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:22,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 351 [2025-01-09 21:28:22,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:23,112 INFO L124 PetriNetUnfolderBase]: 263/1978 cut-off events. [2025-01-09 21:28:23,112 INFO L125 PetriNetUnfolderBase]: For 152/174 co-relation queries the response was YES. [2025-01-09 21:28:23,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 1978 events. 263/1978 cut-off events. For 152/174 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 14662 event pairs, 88 based on Foata normal form. 1/1822 useless extension candidates. Maximal degree in co-relation 2758. Up to 235 conditions per place. [2025-01-09 21:28:23,120 INFO L140 encePairwiseOnDemand]: 348/351 looper letters, 30 selfloop transitions, 3 changer transitions 0/420 dead transitions. [2025-01-09 21:28:23,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 420 transitions, 1349 flow [2025-01-09 21:28:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-01-09 21:28:23,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8831908831908832 [2025-01-09 21:28:23,124 INFO L175 Difference]: Start difference. First operand has 341 places, 412 transitions, 1267 flow. Second operand 3 states and 930 transitions. [2025-01-09 21:28:23,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 420 transitions, 1349 flow [2025-01-09 21:28:23,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 420 transitions, 1349 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:23,135 INFO L231 Difference]: Finished difference. Result has 344 places, 412 transitions, 1278 flow [2025-01-09 21:28:23,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1278, PETRI_PLACES=344, PETRI_TRANSITIONS=412} [2025-01-09 21:28:23,136 INFO L279 CegarLoopForPetriNet]: 324 programPoint places, 20 predicate places. [2025-01-09 21:28:23,136 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 412 transitions, 1278 flow [2025-01-09 21:28:23,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 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-01-09 21:28:23,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:23,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:23,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:28:23,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:23,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1020746517, now seen corresponding path program 1 times [2025-01-09 21:28:23,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:23,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297573861] [2025-01-09 21:28:23,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:23,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:23,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 21:28:23,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 21:28:23,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:23,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:23,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:23,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297573861] [2025-01-09 21:28:23,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297573861] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:28:23,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153639046] [2025-01-09 21:28:23,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:23,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:28:23,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:23,326 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-01-09 21:28:23,327 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-01-09 21:28:23,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 21:28:23,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 21:28:23,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:23,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:23,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:28:23,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:28:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:23,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:28:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:23,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153639046] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:28:23,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:28:23,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-09 21:28:23,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334930644] [2025-01-09 21:28:23,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:28:23,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:28:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:23,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:28:23,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:28:23,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 351 [2025-01-09 21:28:23,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 412 transitions, 1278 flow. Second operand has 18 states, 18 states have (on average 297.94444444444446) internal successors, (5363), 18 states have internal predecessors, (5363), 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-01-09 21:28:23,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:23,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 351 [2025-01-09 21:28:23,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:24,058 INFO L124 PetriNetUnfolderBase]: 243/1947 cut-off events. [2025-01-09 21:28:24,058 INFO L125 PetriNetUnfolderBase]: For 155/187 co-relation queries the response was YES. [2025-01-09 21:28:24,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2866 conditions, 1947 events. 243/1947 cut-off events. For 155/187 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14329 event pairs, 72 based on Foata normal form. 4/1808 useless extension candidates. Maximal degree in co-relation 2664. Up to 232 conditions per place. [2025-01-09 21:28:24,066 INFO L140 encePairwiseOnDemand]: 345/351 looper letters, 31 selfloop transitions, 21 changer transitions 0/430 dead transitions. [2025-01-09 21:28:24,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 430 transitions, 1470 flow [2025-01-09 21:28:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:28:24,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:28:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6272 transitions. [2025-01-09 21:28:24,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8509021842355176 [2025-01-09 21:28:24,076 INFO L175 Difference]: Start difference. First operand has 344 places, 412 transitions, 1278 flow. Second operand 21 states and 6272 transitions. [2025-01-09 21:28:24,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 430 transitions, 1470 flow [2025-01-09 21:28:24,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 430 transitions, 1464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:24,085 INFO L231 Difference]: Finished difference. Result has 367 places, 425 transitions, 1402 flow [2025-01-09 21:28:24,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1402, PETRI_PLACES=367, PETRI_TRANSITIONS=425} [2025-01-09 21:28:24,088 INFO L279 CegarLoopForPetriNet]: 324 programPoint places, 43 predicate places. [2025-01-09 21:28:24,088 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 425 transitions, 1402 flow [2025-01-09 21:28:24,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 297.94444444444446) internal successors, (5363), 18 states have internal predecessors, (5363), 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-01-09 21:28:24,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:24,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:24,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:28:24,291 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-01-09 21:28:24,292 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:24,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:24,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1850620779, now seen corresponding path program 2 times [2025-01-09 21:28:24,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:24,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894451997] [2025-01-09 21:28:24,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:28:24,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:24,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-01-09 21:28:24,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 21:28:24,325 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:28:24,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:24,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:24,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894451997] [2025-01-09 21:28:24,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894451997] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:28:24,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329869089] [2025-01-09 21:28:24,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:28:24,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:28:24,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:24,597 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-01-09 21:28:24,598 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-01-09 21:28:24,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-01-09 21:28:24,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 21:28:24,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:28:24,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:24,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:28:24,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:28:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:24,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:28:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:24,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329869089] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:28:24,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:28:24,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-09 21:28:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691596767] [2025-01-09 21:28:24,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:28:24,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 21:28:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:24,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 21:28:24,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:28:24,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 351 [2025-01-09 21:28:24,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 425 transitions, 1402 flow. Second operand has 23 states, 23 states have (on average 298.04347826086956) internal successors, (6855), 23 states have internal predecessors, (6855), 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-01-09 21:28:24,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:24,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 351 [2025-01-09 21:28:24,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:25,446 INFO L124 PetriNetUnfolderBase]: 243/1962 cut-off events. [2025-01-09 21:28:25,446 INFO L125 PetriNetUnfolderBase]: For 256/288 co-relation queries the response was YES. [2025-01-09 21:28:25,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2966 conditions, 1962 events. 243/1962 cut-off events. For 256/288 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14277 event pairs, 72 based on Foata normal form. 3/1822 useless extension candidates. Maximal degree in co-relation 2664. Up to 232 conditions per place. [2025-01-09 21:28:25,457 INFO L140 encePairwiseOnDemand]: 345/351 looper letters, 34 selfloop transitions, 30 changer transitions 0/442 dead transitions. [2025-01-09 21:28:25,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 442 transitions, 1658 flow [2025-01-09 21:28:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:28:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:28:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8947 transitions. [2025-01-09 21:28:25,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.849667616334283 [2025-01-09 21:28:25,470 INFO L175 Difference]: Start difference. First operand has 367 places, 425 transitions, 1402 flow. Second operand 30 states and 8947 transitions. [2025-01-09 21:28:25,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 442 transitions, 1658 flow [2025-01-09 21:28:25,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 442 transitions, 1628 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-01-09 21:28:25,478 INFO L231 Difference]: Finished difference. Result has 394 places, 435 transitions, 1530 flow [2025-01-09 21:28:25,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1530, PETRI_PLACES=394, PETRI_TRANSITIONS=435} [2025-01-09 21:28:25,479 INFO L279 CegarLoopForPetriNet]: 324 programPoint places, 70 predicate places. [2025-01-09 21:28:25,479 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 435 transitions, 1530 flow [2025-01-09 21:28:25,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 298.04347826086956) internal successors, (6855), 23 states have internal predecessors, (6855), 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-01-09 21:28:25,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:25,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:25,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 21:28:25,685 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-01-09 21:28:25,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:25,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:25,686 INFO L85 PathProgramCache]: Analyzing trace with hash -892766979, now seen corresponding path program 3 times [2025-01-09 21:28:25,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:25,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961868484] [2025-01-09 21:28:25,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:28:25,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:25,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 167 statements into 11 equivalence classes. [2025-01-09 21:28:25,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 21:28:25,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-09 21:28:25,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:25,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:28:25,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 21:28:25,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 21:28:25,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:25,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:25,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:28:25,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:28:25,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-01-09 21:28:25,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-01-09 21:28:25,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:28:25,835 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-01-09 21:28:25,844 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:28:25,844 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:28:25,898 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:28:25,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 469 transitions, 954 flow [2025-01-09 21:28:25,981 INFO L124 PetriNetUnfolderBase]: 72/750 cut-off events. [2025-01-09 21:28:25,982 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:28:25,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 750 events. 72/750 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3335 event pairs, 0 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 480. Up to 12 conditions per place. [2025-01-09 21:28:25,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 469 transitions, 954 flow [2025-01-09 21:28:25,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 429 places, 469 transitions, 954 flow [2025-01-09 21:28:25,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:25,999 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;@5e352e36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:25,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:28:26,009 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:26,010 INFO L124 PetriNetUnfolderBase]: 5/135 cut-off events. [2025-01-09 21:28:26,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:26,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:26,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:26,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 253208851, now seen corresponding path program 1 times [2025-01-09 21:28:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:26,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16483040] [2025-01-09 21:28:26,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:26,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:26,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:28:26,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:28:26,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:26,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:26,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:26,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16483040] [2025-01-09 21:28:26,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16483040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:26,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:26,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:26,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080039865] [2025-01-09 21:28:26,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:26,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:26,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:26,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:26,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:26,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 469 [2025-01-09 21:28:26,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 469 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 394.3333333333333) internal successors, (1183), 3 states have internal predecessors, (1183), 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-01-09 21:28:26,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:26,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 469 [2025-01-09 21:28:26,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:27,466 INFO L124 PetriNetUnfolderBase]: 1580/11913 cut-off events. [2025-01-09 21:28:27,466 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-01-09 21:28:27,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14374 conditions, 11913 events. 1580/11913 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 142511 event pairs, 1464 based on Foata normal form. 2736/13744 useless extension candidates. Maximal degree in co-relation 12718. Up to 2408 conditions per place. [2025-01-09 21:28:27,536 INFO L140 encePairwiseOnDemand]: 427/469 looper letters, 33 selfloop transitions, 2 changer transitions 1/425 dead transitions. [2025-01-09 21:28:27,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 425 transitions, 936 flow [2025-01-09 21:28:27,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2025-01-09 21:28:27,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8912579957356077 [2025-01-09 21:28:27,539 INFO L175 Difference]: Start difference. First operand has 429 places, 469 transitions, 954 flow. Second operand 3 states and 1254 transitions. [2025-01-09 21:28:27,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 425 transitions, 936 flow [2025-01-09 21:28:27,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 425 transitions, 936 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:27,545 INFO L231 Difference]: Finished difference. Result has 426 places, 424 transitions, 874 flow [2025-01-09 21:28:27,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=426, PETRI_TRANSITIONS=424} [2025-01-09 21:28:27,550 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -3 predicate places. [2025-01-09 21:28:27,550 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 424 transitions, 874 flow [2025-01-09 21:28:27,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.3333333333333) internal successors, (1183), 3 states have internal predecessors, (1183), 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-01-09 21:28:27,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:27,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:27,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:28:27,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:27,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:27,551 INFO L85 PathProgramCache]: Analyzing trace with hash -895098054, now seen corresponding path program 1 times [2025-01-09 21:28:27,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:27,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486744779] [2025-01-09 21:28:27,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:27,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:27,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:28:27,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:28:27,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:27,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:27,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:27,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486744779] [2025-01-09 21:28:27,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486744779] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:28:27,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914891569] [2025-01-09 21:28:27,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:27,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:28:27,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:27,633 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-01-09 21:28:27,635 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-01-09 21:28:27,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:28:27,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:28:27,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:27,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:27,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:28:27,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:28:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:27,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:28:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:27,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914891569] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:28:27,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:28:27,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:28:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755825672] [2025-01-09 21:28:27,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:28:27,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:28:27,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:27,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:28:27,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:28:27,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 469 [2025-01-09 21:28:27,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 424 transitions, 874 flow. Second operand has 10 states, 10 states have (on average 391.8) internal successors, (3918), 10 states have internal predecessors, (3918), 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-01-09 21:28:27,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:27,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 469 [2025-01-09 21:28:27,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:29,297 INFO L124 PetriNetUnfolderBase]: 1580/11919 cut-off events. [2025-01-09 21:28:29,297 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-01-09 21:28:29,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14399 conditions, 11919 events. 1580/11919 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 142591 event pairs, 1464 based on Foata normal form. 2/11017 useless extension candidates. Maximal degree in co-relation 14303. Up to 2408 conditions per place. [2025-01-09 21:28:29,375 INFO L140 encePairwiseOnDemand]: 463/469 looper letters, 37 selfloop transitions, 9 changer transitions 0/432 dead transitions. [2025-01-09 21:28:29,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 432 transitions, 984 flow [2025-01-09 21:28:29,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:28:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:28:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3558 transitions. [2025-01-09 21:28:29,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8429282160625444 [2025-01-09 21:28:29,380 INFO L175 Difference]: Start difference. First operand has 426 places, 424 transitions, 874 flow. Second operand 9 states and 3558 transitions. [2025-01-09 21:28:29,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 432 transitions, 984 flow [2025-01-09 21:28:29,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 432 transitions, 982 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:29,385 INFO L231 Difference]: Finished difference. Result has 435 places, 430 transitions, 922 flow [2025-01-09 21:28:29,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=922, PETRI_PLACES=435, PETRI_TRANSITIONS=430} [2025-01-09 21:28:29,386 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, 6 predicate places. [2025-01-09 21:28:29,387 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 430 transitions, 922 flow [2025-01-09 21:28:29,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 391.8) internal successors, (3918), 10 states have internal predecessors, (3918), 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-01-09 21:28:29,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:29,388 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:29,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 21:28:29,588 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-01-09 21:28:29,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:29,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash -186786086, now seen corresponding path program 2 times [2025-01-09 21:28:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:29,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898393463] [2025-01-09 21:28:29,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:28:29,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:29,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-01-09 21:28:29,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 117 statements. [2025-01-09 21:28:29,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:28:29,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:28:29,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:29,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898393463] [2025-01-09 21:28:29,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898393463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:29,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:29,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645072941] [2025-01-09 21:28:29,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:29,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:29,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:29,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:29,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:30,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 469 [2025-01-09 21:28:30,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 430 transitions, 922 flow. Second operand has 6 states, 6 states have (on average 322.5) internal successors, (1935), 6 states have internal predecessors, (1935), 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-01-09 21:28:30,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:30,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 469 [2025-01-09 21:28:30,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:52,069 INFO L124 PetriNetUnfolderBase]: 83051/196668 cut-off events. [2025-01-09 21:28:52,069 INFO L125 PetriNetUnfolderBase]: For 1130/1130 co-relation queries the response was YES. [2025-01-09 21:28:52,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321697 conditions, 196668 events. 83051/196668 cut-off events. For 1130/1130 co-relation queries the response was YES. Maximal size of possible extension queue 3941. Compared 2613194 event pairs, 59498 based on Foata normal form. 0/183950 useless extension candidates. Maximal degree in co-relation 321572. Up to 116891 conditions per place. [2025-01-09 21:28:53,257 INFO L140 encePairwiseOnDemand]: 422/469 looper letters, 170 selfloop transitions, 166 changer transitions 0/660 dead transitions. [2025-01-09 21:28:53,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 660 transitions, 2059 flow [2025-01-09 21:28:53,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2263 transitions. [2025-01-09 21:28:53,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8041933191186923 [2025-01-09 21:28:53,260 INFO L175 Difference]: Start difference. First operand has 435 places, 430 transitions, 922 flow. Second operand 6 states and 2263 transitions. [2025-01-09 21:28:53,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 660 transitions, 2059 flow [2025-01-09 21:28:53,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 660 transitions, 2053 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:53,274 INFO L231 Difference]: Finished difference. Result has 444 places, 595 transitions, 2002 flow [2025-01-09 21:28:53,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2002, PETRI_PLACES=444, PETRI_TRANSITIONS=595} [2025-01-09 21:28:53,275 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, 15 predicate places. [2025-01-09 21:28:53,275 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 595 transitions, 2002 flow [2025-01-09 21:28:53,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 322.5) internal successors, (1935), 6 states have internal predecessors, (1935), 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-01-09 21:28:53,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:53,276 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:53,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:28:53,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:53,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash -523074922, now seen corresponding path program 1 times [2025-01-09 21:28:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:53,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045442542] [2025-01-09 21:28:53,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:53,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:53,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:28:53,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:28:53,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:53,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:28:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:53,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045442542] [2025-01-09 21:28:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045442542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:53,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523782477] [2025-01-09 21:28:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:53,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:53,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:53,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 469 [2025-01-09 21:28:53,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 595 transitions, 2002 flow. Second operand has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 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-01-09 21:28:53,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:53,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 469 [2025-01-09 21:28:53,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand