./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.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/09-regions_12-arraycollapse_rc.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 034172cc4904075fab6f792587170b7236be9fb41f3a62fa7fbe9a216ec4ca2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:24:08,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:24:08,241 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:24:08,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:24:08,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:24:08,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:24:08,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:24:08,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:24:08,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:24:08,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:24:08,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:24:08,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:24:08,271 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:24:08,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:24:08,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:24:08,271 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:24:08,272 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:08,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:08,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:24:08,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:24:08,273 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:24:08,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:24:08,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:24:08,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:24:08,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:24:08,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:24:08,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:24:08,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:24:08,273 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 -> 034172cc4904075fab6f792587170b7236be9fb41f3a62fa7fbe9a216ec4ca2c [2025-01-09 21:24:08,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:24:08,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:24:08,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:24:08,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:24:08,495 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:24:08,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-01-09 21:24:09,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af653c932/8338a766a6e7497297e5969516d36ceb/FLAG2c321b19f [2025-01-09 21:24:09,892 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:24:09,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-01-09 21:24:09,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af653c932/8338a766a6e7497297e5969516d36ceb/FLAG2c321b19f [2025-01-09 21:24:10,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af653c932/8338a766a6e7497297e5969516d36ceb [2025-01-09 21:24:10,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:24:10,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:24:10,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:24:10,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:24:10,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:24:10,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74781be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10, skipping insertion in model container [2025-01-09 21:24:10,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:24:10,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:24:10,647 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:24:10,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:24:10,725 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:24:10,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10 WrapperNode [2025-01-09 21:24:10,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:24:10,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:24:10,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:24:10,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:24:10,730 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:24:10" (1/1) ... [2025-01-09 21:24:10,745 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:24:10" (1/1) ... [2025-01-09 21:24:10,779 INFO L138 Inliner]: procedures = 372, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 389 [2025-01-09 21:24:10,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:24:10,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:24:10,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:24:10,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:24:10,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,824 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:24:10,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:24:10,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:24:10,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:24:10,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10" (1/1) ... [2025-01-09 21:24:10,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:10,873 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:24:10,881 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:24:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:24:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:24:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:24:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:24:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:24:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:24:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:24:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:24:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:24:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:24:10,894 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:24:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:24:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:24:10,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:24:10,894 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:24:11,020 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:24:11,021 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:24:11,484 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:24:11,484 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:24:11,510 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:24:11,513 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:24:11,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:11 BoogieIcfgContainer [2025-01-09 21:24:11,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:24:11,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:24:11,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:24:11,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:24:11,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:24:10" (1/3) ... [2025-01-09 21:24:11,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ca7f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:11, skipping insertion in model container [2025-01-09 21:24:11,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:10" (2/3) ... [2025-01-09 21:24:11,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ca7f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:11, skipping insertion in model container [2025-01-09 21:24:11,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:11" (3/3) ... [2025-01-09 21:24:11,521 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc.i [2025-01-09 21:24:11,531 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:24:11,533 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_12-arraycollapse_rc.i that has 2 procedures, 454 locations, 1 initial locations, 1 loop locations, and 28 error locations. [2025-01-09 21:24:11,534 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:24:11,633 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:24:11,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 457 places, 457 transitions, 918 flow [2025-01-09 21:24:11,747 INFO L124 PetriNetUnfolderBase]: 4/456 cut-off events. [2025-01-09 21:24:11,751 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:11,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 456 events. 4/456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 362 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 328. Up to 2 conditions per place. [2025-01-09 21:24:11,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 457 places, 457 transitions, 918 flow [2025-01-09 21:24:11,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 456 places, 456 transitions, 915 flow [2025-01-09 21:24:11,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:24:11,771 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;@bcebdb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:24:11,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-01-09 21:24:11,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:24:11,782 INFO L124 PetriNetUnfolderBase]: 1/102 cut-off events. [2025-01-09 21:24:11,782 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:11,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:11,782 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] [2025-01-09 21:24:11,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:11,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:11,786 INFO L85 PathProgramCache]: Analyzing trace with hash 351475653, now seen corresponding path program 1 times [2025-01-09 21:24:11,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:11,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754770761] [2025-01-09 21:24:11,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:11,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:24:11,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:24:11,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:11,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:12,602 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:24:12,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:12,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754770761] [2025-01-09 21:24:12,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754770761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:12,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:12,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:12,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053082618] [2025-01-09 21:24:12,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:12,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:12,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:12,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:12,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:13,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 457 [2025-01-09 21:24:13,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 456 transitions, 915 flow. Second operand has 6 states, 6 states have (on average 329.3333333333333) internal successors, (1976), 6 states have internal predecessors, (1976), 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:24:13,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:13,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 457 [2025-01-09 21:24:13,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:13,528 INFO L124 PetriNetUnfolderBase]: 365/1803 cut-off events. [2025-01-09 21:24:13,528 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:24:13,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2659 conditions, 1803 events. 365/1803 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9435 event pairs, 364 based on Foata normal form. 12/1678 useless extension candidates. Maximal degree in co-relation 2247. Up to 837 conditions per place. [2025-01-09 21:24:13,536 INFO L140 encePairwiseOnDemand]: 436/457 looper letters, 108 selfloop transitions, 15 changer transitions 2/450 dead transitions. [2025-01-09 21:24:13,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 450 transitions, 1149 flow [2025-01-09 21:24:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2097 transitions. [2025-01-09 21:24:13,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7647702407002188 [2025-01-09 21:24:13,551 INFO L175 Difference]: Start difference. First operand has 456 places, 456 transitions, 915 flow. Second operand 6 states and 2097 transitions. [2025-01-09 21:24:13,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 450 transitions, 1149 flow [2025-01-09 21:24:13,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 450 transitions, 1148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:13,562 INFO L231 Difference]: Finished difference. Result has 457 places, 448 transitions, 928 flow [2025-01-09 21:24:13,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=928, PETRI_PLACES=457, PETRI_TRANSITIONS=448} [2025-01-09 21:24:13,565 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 1 predicate places. [2025-01-09 21:24:13,565 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 448 transitions, 928 flow [2025-01-09 21:24:13,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 329.3333333333333) internal successors, (1976), 6 states have internal predecessors, (1976), 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:24:13,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:13,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:13,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:24:13,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:13,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:13,568 INFO L85 PathProgramCache]: Analyzing trace with hash -584403533, now seen corresponding path program 1 times [2025-01-09 21:24:13,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:13,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484021525] [2025-01-09 21:24:13,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:13,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:13,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:24:13,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:24:13,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:13,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:13,900 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:24:13,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484021525] [2025-01-09 21:24:13,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484021525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:13,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:13,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263536065] [2025-01-09 21:24:13,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:13,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:13,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:13,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:14,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 457 [2025-01-09 21:24:14,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 448 transitions, 928 flow. Second operand has 6 states, 6 states have (on average 329.3333333333333) internal successors, (1976), 6 states have internal predecessors, (1976), 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:24:14,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:14,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 457 [2025-01-09 21:24:14,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:14,742 INFO L124 PetriNetUnfolderBase]: 365/1798 cut-off events. [2025-01-09 21:24:14,743 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:14,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 1798 events. 365/1798 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9410 event pairs, 364 based on Foata normal form. 0/1666 useless extension candidates. Maximal degree in co-relation 2390. Up to 837 conditions per place. [2025-01-09 21:24:14,748 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 108 selfloop transitions, 15 changer transitions 0/445 dead transitions. [2025-01-09 21:24:14,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 445 transitions, 1168 flow [2025-01-09 21:24:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2094 transitions. [2025-01-09 21:24:14,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7636761487964989 [2025-01-09 21:24:14,753 INFO L175 Difference]: Start difference. First operand has 457 places, 448 transitions, 928 flow. Second operand 6 states and 2094 transitions. [2025-01-09 21:24:14,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 445 transitions, 1168 flow [2025-01-09 21:24:14,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 445 transitions, 1138 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:14,759 INFO L231 Difference]: Finished difference. Result has 452 places, 445 transitions, 922 flow [2025-01-09 21:24:14,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=452, PETRI_TRANSITIONS=445} [2025-01-09 21:24:14,760 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -4 predicate places. [2025-01-09 21:24:14,760 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 445 transitions, 922 flow [2025-01-09 21:24:14,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 329.3333333333333) internal successors, (1976), 6 states have internal predecessors, (1976), 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:24:14,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:14,761 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] [2025-01-09 21:24:14,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:24:14,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:14,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:14,762 INFO L85 PathProgramCache]: Analyzing trace with hash 393969553, now seen corresponding path program 1 times [2025-01-09 21:24:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:14,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964348452] [2025-01-09 21:24:14,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:14,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:24:14,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:24:14,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:14,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:15,128 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:24:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964348452] [2025-01-09 21:24:15,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964348452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:15,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:15,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:15,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941958864] [2025-01-09 21:24:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:15,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:15,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:15,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:15,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:15,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 457 [2025-01-09 21:24:15,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 445 transitions, 922 flow. Second operand has 6 states, 6 states have (on average 328.8333333333333) internal successors, (1973), 6 states have internal predecessors, (1973), 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:24:15,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:15,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 457 [2025-01-09 21:24:15,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:15,805 INFO L124 PetriNetUnfolderBase]: 391/1887 cut-off events. [2025-01-09 21:24:15,805 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:24:15,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2814 conditions, 1887 events. 391/1887 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10163 event pairs, 390 based on Foata normal form. 0/1749 useless extension candidates. Maximal degree in co-relation 2517. Up to 903 conditions per place. [2025-01-09 21:24:15,813 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 122 selfloop transitions, 5 changer transitions 0/444 dead transitions. [2025-01-09 21:24:15,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 444 transitions, 1174 flow [2025-01-09 21:24:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2084 transitions. [2025-01-09 21:24:15,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7600291757840992 [2025-01-09 21:24:15,817 INFO L175 Difference]: Start difference. First operand has 452 places, 445 transitions, 922 flow. Second operand 6 states and 2084 transitions. [2025-01-09 21:24:15,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 444 transitions, 1174 flow [2025-01-09 21:24:15,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 444 transitions, 1144 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:15,823 INFO L231 Difference]: Finished difference. Result has 451 places, 444 transitions, 900 flow [2025-01-09 21:24:15,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=451, PETRI_TRANSITIONS=444} [2025-01-09 21:24:15,824 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -5 predicate places. [2025-01-09 21:24:15,824 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 444 transitions, 900 flow [2025-01-09 21:24:15,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 328.8333333333333) internal successors, (1973), 6 states have internal predecessors, (1973), 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:24:15,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:15,826 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, 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:24:15,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:24:15,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:15,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash 816020147, now seen corresponding path program 1 times [2025-01-09 21:24:15,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:15,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474121802] [2025-01-09 21:24:15,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:15,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:15,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:24:15,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:24:15,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:15,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:15,929 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:24:15,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:15,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474121802] [2025-01-09 21:24:15,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474121802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:15,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:15,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:24:15,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541722392] [2025-01-09 21:24:15,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:15,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:24:15,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:15,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:24:15,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:24:15,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 457 [2025-01-09 21:24:15,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 444 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 444.3333333333333) internal successors, (1333), 3 states have internal predecessors, (1333), 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:24:15,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:15,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 457 [2025-01-09 21:24:15,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:16,012 INFO L124 PetriNetUnfolderBase]: 7/629 cut-off events. [2025-01-09 21:24:16,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:16,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 629 events. 7/629 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 631 event pairs, 6 based on Foata normal form. 1/594 useless extension candidates. Maximal degree in co-relation 467. Up to 24 conditions per place. [2025-01-09 21:24:16,013 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 10 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2025-01-09 21:24:16,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 445 transitions, 926 flow [2025-01-09 21:24:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:24:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:24:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1342 transitions. [2025-01-09 21:24:16,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9788475565280816 [2025-01-09 21:24:16,015 INFO L175 Difference]: Start difference. First operand has 451 places, 444 transitions, 900 flow. Second operand 3 states and 1342 transitions. [2025-01-09 21:24:16,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 445 transitions, 926 flow [2025-01-09 21:24:16,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 445 transitions, 916 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:16,022 INFO L231 Difference]: Finished difference. Result has 449 places, 445 transitions, 902 flow [2025-01-09 21:24:16,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=449, PETRI_TRANSITIONS=445} [2025-01-09 21:24:16,023 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -7 predicate places. [2025-01-09 21:24:16,023 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 445 transitions, 902 flow [2025-01-09 21:24:16,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.3333333333333) internal successors, (1333), 3 states have internal predecessors, (1333), 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:24:16,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:16,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:24:16,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:16,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash -503993896, now seen corresponding path program 1 times [2025-01-09 21:24:16,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:16,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196098181] [2025-01-09 21:24:16,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:16,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 21:24:16,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 21:24:16,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:16,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:16,440 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:24:16,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:16,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196098181] [2025-01-09 21:24:16,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196098181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:16,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:16,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:16,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381511980] [2025-01-09 21:24:16,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:16,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:16,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:16,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:17,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 457 [2025-01-09 21:24:17,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 445 transitions, 902 flow. Second operand has 6 states, 6 states have (on average 372.8333333333333) internal successors, (2237), 6 states have internal predecessors, (2237), 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:24:17,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:17,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 457 [2025-01-09 21:24:17,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:17,262 INFO L124 PetriNetUnfolderBase]: 55/870 cut-off events. [2025-01-09 21:24:17,262 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:24:17,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 870 events. 55/870 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2229 event pairs, 54 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 887. Up to 219 conditions per place. [2025-01-09 21:24:17,264 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 81 selfloop transitions, 5 changer transitions 0/444 dead transitions. [2025-01-09 21:24:17,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 444 transitions, 1072 flow [2025-01-09 21:24:17,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2294 transitions. [2025-01-09 21:24:17,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8366156090444931 [2025-01-09 21:24:17,267 INFO L175 Difference]: Start difference. First operand has 449 places, 445 transitions, 902 flow. Second operand 6 states and 2294 transitions. [2025-01-09 21:24:17,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 444 transitions, 1072 flow [2025-01-09 21:24:17,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 444 transitions, 1070 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:17,272 INFO L231 Difference]: Finished difference. Result has 452 places, 444 transitions, 908 flow [2025-01-09 21:24:17,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=452, PETRI_TRANSITIONS=444} [2025-01-09 21:24:17,273 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -4 predicate places. [2025-01-09 21:24:17,273 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 444 transitions, 908 flow [2025-01-09 21:24:17,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.8333333333333) internal successors, (2237), 6 states have internal predecessors, (2237), 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:24:17,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:17,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:17,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:24:17,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:17,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash -996390395, now seen corresponding path program 1 times [2025-01-09 21:24:17,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277651927] [2025-01-09 21:24:17,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:17,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 21:24:17,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 21:24:17,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:17,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:17,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:17,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277651927] [2025-01-09 21:24:17,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277651927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:17,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:17,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:17,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795793461] [2025-01-09 21:24:17,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:17,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:17,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:17,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:18,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 457 [2025-01-09 21:24:18,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 444 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 355.5) internal successors, (2133), 6 states have internal predecessors, (2133), 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:24:18,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:18,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 457 [2025-01-09 21:24:18,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:18,487 INFO L124 PetriNetUnfolderBase]: 37/783 cut-off events. [2025-01-09 21:24:18,487 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:24:18,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 783 events. 37/783 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1733 event pairs, 36 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 755. Up to 190 conditions per place. [2025-01-09 21:24:18,489 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 85 selfloop transitions, 15 changer transitions 0/441 dead transitions. [2025-01-09 21:24:18,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 441 transitions, 1102 flow [2025-01-09 21:24:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2209 transitions. [2025-01-09 21:24:18,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8056163384390955 [2025-01-09 21:24:18,492 INFO L175 Difference]: Start difference. First operand has 452 places, 444 transitions, 908 flow. Second operand 6 states and 2209 transitions. [2025-01-09 21:24:18,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 441 transitions, 1102 flow [2025-01-09 21:24:18,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 441 transitions, 1092 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:18,497 INFO L231 Difference]: Finished difference. Result has 449 places, 441 transitions, 922 flow [2025-01-09 21:24:18,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=449, PETRI_TRANSITIONS=441} [2025-01-09 21:24:18,498 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -7 predicate places. [2025-01-09 21:24:18,498 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 441 transitions, 922 flow [2025-01-09 21:24:18,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 355.5) internal successors, (2133), 6 states have internal predecessors, (2133), 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:24:18,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:18,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:18,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:24:18,499 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:18,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:18,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1798206450, now seen corresponding path program 1 times [2025-01-09 21:24:18,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:18,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393869479] [2025-01-09 21:24:18,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:18,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:18,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:24:18,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:24:18,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:18,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:18,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:18,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393869479] [2025-01-09 21:24:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393869479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:18,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:18,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399137082] [2025-01-09 21:24:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:18,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:18,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:18,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:19,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 457 [2025-01-09 21:24:19,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 441 transitions, 922 flow. Second operand has 6 states, 6 states have (on average 319.1666666666667) internal successors, (1915), 6 states have internal predecessors, (1915), 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:24:19,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:19,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 457 [2025-01-09 21:24:19,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:19,570 INFO L124 PetriNetUnfolderBase]: 365/1896 cut-off events. [2025-01-09 21:24:19,570 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:24:19,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 1896 events. 365/1896 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9436 event pairs, 364 based on Foata normal form. 0/1772 useless extension candidates. Maximal degree in co-relation 2448. Up to 890 conditions per place. [2025-01-09 21:24:19,576 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 123 selfloop transitions, 15 changer transitions 0/438 dead transitions. [2025-01-09 21:24:19,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 438 transitions, 1192 flow [2025-01-09 21:24:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2019 transitions. [2025-01-09 21:24:19,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7363238512035011 [2025-01-09 21:24:19,580 INFO L175 Difference]: Start difference. First operand has 449 places, 441 transitions, 922 flow. Second operand 6 states and 2019 transitions. [2025-01-09 21:24:19,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 438 transitions, 1192 flow [2025-01-09 21:24:19,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 438 transitions, 1162 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:19,585 INFO L231 Difference]: Finished difference. Result has 446 places, 438 transitions, 916 flow [2025-01-09 21:24:19,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=916, PETRI_PLACES=446, PETRI_TRANSITIONS=438} [2025-01-09 21:24:19,586 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -10 predicate places. [2025-01-09 21:24:19,587 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 438 transitions, 916 flow [2025-01-09 21:24:19,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 319.1666666666667) internal successors, (1915), 6 states have internal predecessors, (1915), 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:24:19,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:19,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:19,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:24:19,588 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:19,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash 516346251, now seen corresponding path program 1 times [2025-01-09 21:24:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:19,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439507940] [2025-01-09 21:24:19,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:19,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 21:24:19,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 21:24:19,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:19,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:19,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:19,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439507940] [2025-01-09 21:24:19,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439507940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:19,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:19,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:19,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290797587] [2025-01-09 21:24:19,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:19,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:19,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:19,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:19,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:20,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 457 [2025-01-09 21:24:20,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 438 transitions, 916 flow. Second operand has 6 states, 6 states have (on average 322.6666666666667) internal successors, (1936), 6 states have internal predecessors, (1936), 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:24:20,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:20,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 457 [2025-01-09 21:24:20,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:20,661 INFO L124 PetriNetUnfolderBase]: 365/1892 cut-off events. [2025-01-09 21:24:20,661 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:24:20,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1892 events. 365/1892 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9374 event pairs, 364 based on Foata normal form. 0/1772 useless extension candidates. Maximal degree in co-relation 2444. Up to 886 conditions per place. [2025-01-09 21:24:20,666 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 120 selfloop transitions, 15 changer transitions 0/435 dead transitions. [2025-01-09 21:24:20,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 435 transitions, 1180 flow [2025-01-09 21:24:20,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2034 transitions. [2025-01-09 21:24:20,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7417943107221007 [2025-01-09 21:24:20,670 INFO L175 Difference]: Start difference. First operand has 446 places, 438 transitions, 916 flow. Second operand 6 states and 2034 transitions. [2025-01-09 21:24:20,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 435 transitions, 1180 flow [2025-01-09 21:24:20,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 435 transitions, 1150 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:20,675 INFO L231 Difference]: Finished difference. Result has 443 places, 435 transitions, 910 flow [2025-01-09 21:24:20,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=443, PETRI_TRANSITIONS=435} [2025-01-09 21:24:20,677 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -13 predicate places. [2025-01-09 21:24:20,678 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 435 transitions, 910 flow [2025-01-09 21:24:20,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 322.6666666666667) internal successors, (1936), 6 states have internal predecessors, (1936), 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:24:20,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:20,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:20,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:24:20,679 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:20,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash -660004409, now seen corresponding path program 1 times [2025-01-09 21:24:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509767596] [2025-01-09 21:24:20,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:20,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:20,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 21:24:20,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 21:24:20,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:20,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:20,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:20,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509767596] [2025-01-09 21:24:20,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509767596] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:20,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631715384] [2025-01-09 21:24:20,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:20,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:20,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:20,847 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:24:20,848 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:24:20,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 21:24:21,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 21:24:21,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:21,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:21,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:24:21,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:21,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:21,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631715384] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:21,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:21,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:24:21,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584943250] [2025-01-09 21:24:21,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:21,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:24:21,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:21,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:24:21,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:24:21,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 457 [2025-01-09 21:24:21,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 435 transitions, 910 flow. Second operand has 10 states, 10 states have (on average 441.8) internal successors, (4418), 10 states have internal predecessors, (4418), 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:24:21,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:21,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 457 [2025-01-09 21:24:21,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:21,553 INFO L124 PetriNetUnfolderBase]: 7/723 cut-off events. [2025-01-09 21:24:21,553 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:21,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 723 events. 7/723 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 386 event pairs, 6 based on Foata normal form. 2/703 useless extension candidates. Maximal degree in co-relation 365. Up to 24 conditions per place. [2025-01-09 21:24:21,555 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 14 selfloop transitions, 9 changer transitions 0/443 dead transitions. [2025-01-09 21:24:21,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 443 transitions, 974 flow [2025-01-09 21:24:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:24:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:24:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3985 transitions. [2025-01-09 21:24:21,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688791636275225 [2025-01-09 21:24:21,560 INFO L175 Difference]: Start difference. First operand has 443 places, 435 transitions, 910 flow. Second operand 9 states and 3985 transitions. [2025-01-09 21:24:21,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 443 transitions, 974 flow [2025-01-09 21:24:21,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 443 transitions, 944 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:21,566 INFO L231 Difference]: Finished difference. Result has 449 places, 441 transitions, 930 flow [2025-01-09 21:24:21,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=930, PETRI_PLACES=449, PETRI_TRANSITIONS=441} [2025-01-09 21:24:21,567 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -7 predicate places. [2025-01-09 21:24:21,568 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 441 transitions, 930 flow [2025-01-09 21:24:21,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 441.8) internal successors, (4418), 10 states have internal predecessors, (4418), 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:24:21,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:21,570 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:21,579 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:24:21,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:21,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:21,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:21,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1918338287, now seen corresponding path program 2 times [2025-01-09 21:24:21,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:21,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968935858] [2025-01-09 21:24:21,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:21,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:21,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 446 statements into 2 equivalence classes. [2025-01-09 21:24:21,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 128 of 446 statements. [2025-01-09 21:24:21,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:21,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 21:24:22,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:22,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968935858] [2025-01-09 21:24:22,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968935858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:22,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:22,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:22,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577557107] [2025-01-09 21:24:22,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:22,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:22,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:22,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:22,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:22,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 457 [2025-01-09 21:24:22,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 441 transitions, 930 flow. Second operand has 6 states, 6 states have (on average 372.3333333333333) internal successors, (2234), 6 states have internal predecessors, (2234), 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:24:22,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:22,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 457 [2025-01-09 21:24:22,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:23,129 INFO L124 PetriNetUnfolderBase]: 257/1976 cut-off events. [2025-01-09 21:24:23,130 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:24:23,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 1976 events. 257/1976 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 9060 event pairs, 37 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 2169. Up to 515 conditions per place. [2025-01-09 21:24:23,135 INFO L140 encePairwiseOnDemand]: 428/457 looper letters, 91 selfloop transitions, 75 changer transitions 0/518 dead transitions. [2025-01-09 21:24:23,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 518 transitions, 1416 flow [2025-01-09 21:24:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2358 transitions. [2025-01-09 21:24:23,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8599562363238512 [2025-01-09 21:24:23,139 INFO L175 Difference]: Start difference. First operand has 449 places, 441 transitions, 930 flow. Second operand 6 states and 2358 transitions. [2025-01-09 21:24:23,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 518 transitions, 1416 flow [2025-01-09 21:24:23,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 518 transitions, 1410 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:23,145 INFO L231 Difference]: Finished difference. Result has 457 places, 509 transitions, 1404 flow [2025-01-09 21:24:23,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1404, PETRI_PLACES=457, PETRI_TRANSITIONS=509} [2025-01-09 21:24:23,146 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 1 predicate places. [2025-01-09 21:24:23,146 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 509 transitions, 1404 flow [2025-01-09 21:24:23,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.3333333333333) internal successors, (2234), 6 states have internal predecessors, (2234), 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:24:23,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:23,147 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:23,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:24:23,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:23,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:23,148 INFO L85 PathProgramCache]: Analyzing trace with hash -642922690, now seen corresponding path program 1 times [2025-01-09 21:24:23,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:23,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358772135] [2025-01-09 21:24:23,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:23,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:23,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 21:24:23,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 21:24:23,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:23,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:24:23,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358772135] [2025-01-09 21:24:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358772135] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407394502] [2025-01-09 21:24:23,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:23,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:23,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:23,539 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:24:23,542 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:24:23,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 21:24:23,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 21:24:23,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:23,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:23,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:24:23,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:24:24,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:24:24,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407394502] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:24,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:24,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-09 21:24:24,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287283855] [2025-01-09 21:24:24,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:24,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:24:24,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:24,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:24:24,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:24:25,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 457 [2025-01-09 21:24:25,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 509 transitions, 1404 flow. Second operand has 18 states, 18 states have (on average 441.8888888888889) internal successors, (7954), 18 states have internal predecessors, (7954), 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:24:25,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:25,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 457 [2025-01-09 21:24:25,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:25,584 INFO L124 PetriNetUnfolderBase]: 166/2172 cut-off events. [2025-01-09 21:24:25,584 INFO L125 PetriNetUnfolderBase]: For 184/198 co-relation queries the response was YES. [2025-01-09 21:24:25,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2909 conditions, 2172 events. 166/2172 cut-off events. For 184/198 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7422 event pairs, 23 based on Foata normal form. 4/2089 useless extension candidates. Maximal degree in co-relation 2012. Up to 208 conditions per place. [2025-01-09 21:24:25,589 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 19 selfloop transitions, 21 changer transitions 0/527 dead transitions. [2025-01-09 21:24:25,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 527 transitions, 1572 flow [2025-01-09 21:24:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:24:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:24:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9283 transitions. [2025-01-09 21:24:25,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672814421173284 [2025-01-09 21:24:25,601 INFO L175 Difference]: Start difference. First operand has 457 places, 509 transitions, 1404 flow. Second operand 21 states and 9283 transitions. [2025-01-09 21:24:25,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 527 transitions, 1572 flow [2025-01-09 21:24:25,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 527 transitions, 1572 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:25,607 INFO L231 Difference]: Finished difference. Result has 482 places, 522 transitions, 1534 flow [2025-01-09 21:24:25,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1534, PETRI_PLACES=482, PETRI_TRANSITIONS=522} [2025-01-09 21:24:25,608 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 26 predicate places. [2025-01-09 21:24:25,608 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 522 transitions, 1534 flow [2025-01-09 21:24:25,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 441.8888888888889) internal successors, (7954), 18 states have internal predecessors, (7954), 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:24:25,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:25,610 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:25,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:24:25,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:25,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:25,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1413668590, now seen corresponding path program 2 times [2025-01-09 21:24:25,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319382908] [2025-01-09 21:24:25,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:25,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:25,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 907 statements into 2 equivalence classes. [2025-01-09 21:24:25,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 165 of 907 statements. [2025-01-09 21:24:25,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:25,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2282 trivial. 0 not checked. [2025-01-09 21:24:26,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:26,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319382908] [2025-01-09 21:24:26,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319382908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:26,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:26,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:26,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365498731] [2025-01-09 21:24:26,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:26,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:26,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:26,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:26,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:27,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 457 [2025-01-09 21:24:27,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 522 transitions, 1534 flow. Second operand has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 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:24:27,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:27,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 457 [2025-01-09 21:24:27,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:27,423 INFO L124 PetriNetUnfolderBase]: 227/2346 cut-off events. [2025-01-09 21:24:27,423 INFO L125 PetriNetUnfolderBase]: For 437/481 co-relation queries the response was YES. [2025-01-09 21:24:27,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3668 conditions, 2346 events. 227/2346 cut-off events. For 437/481 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8639 event pairs, 55 based on Foata normal form. 0/2232 useless extension candidates. Maximal degree in co-relation 2566. Up to 564 conditions per place. [2025-01-09 21:24:27,430 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 142 selfloop transitions, 5 changer transitions 0/521 dead transitions. [2025-01-09 21:24:27,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 521 transitions, 1826 flow [2025-01-09 21:24:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2309 transitions. [2025-01-09 21:24:27,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8420860685630926 [2025-01-09 21:24:27,432 INFO L175 Difference]: Start difference. First operand has 482 places, 522 transitions, 1534 flow. Second operand 6 states and 2309 transitions. [2025-01-09 21:24:27,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 521 transitions, 1826 flow [2025-01-09 21:24:27,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 521 transitions, 1802 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 21:24:27,439 INFO L231 Difference]: Finished difference. Result has 480 places, 521 transitions, 1518 flow [2025-01-09 21:24:27,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1518, PETRI_PLACES=480, PETRI_TRANSITIONS=521} [2025-01-09 21:24:27,440 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 24 predicate places. [2025-01-09 21:24:27,440 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 521 transitions, 1518 flow [2025-01-09 21:24:27,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 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:24:27,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:27,441 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:27,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:24:27,442 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:27,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:27,443 INFO L85 PathProgramCache]: Analyzing trace with hash 340710746, now seen corresponding path program 1 times [2025-01-09 21:24:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498864733] [2025-01-09 21:24:27,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:27,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 958 statements into 1 equivalence classes. [2025-01-09 21:24:27,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 958 of 958 statements. [2025-01-09 21:24:27,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:27,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:24:28,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:28,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498864733] [2025-01-09 21:24:28,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498864733] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:28,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881038886] [2025-01-09 21:24:28,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:28,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:28,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:28,796 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:24:28,798 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:24:29,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 958 statements into 1 equivalence classes. [2025-01-09 21:24:29,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 958 of 958 statements. [2025-01-09 21:24:29,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:29,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:29,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 3674 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:24:29,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:24:30,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:24:30,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881038886] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:30,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:30,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-09 21:24:30,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053709909] [2025-01-09 21:24:30,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:30,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 21:24:30,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:30,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 21:24:30,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:24:31,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 457 [2025-01-09 21:24:31,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 521 transitions, 1518 flow. Second operand has 23 states, 23 states have (on average 442.0869565217391) internal successors, (10168), 23 states have internal predecessors, (10168), 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:24:31,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:31,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 457 [2025-01-09 21:24:31,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:31,610 INFO L124 PetriNetUnfolderBase]: 173/2503 cut-off events. [2025-01-09 21:24:31,611 INFO L125 PetriNetUnfolderBase]: For 301/308 co-relation queries the response was YES. [2025-01-09 21:24:31,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3342 conditions, 2503 events. 173/2503 cut-off events. For 301/308 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7499 event pairs, 23 based on Foata normal form. 3/2420 useless extension candidates. Maximal degree in co-relation 2058. Up to 208 conditions per place. [2025-01-09 21:24:31,617 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 22 selfloop transitions, 30 changer transitions 0/538 dead transitions. [2025-01-09 21:24:31,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 538 transitions, 1744 flow [2025-01-09 21:24:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:24:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:24:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 13254 transitions. [2025-01-09 21:24:31,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667396061269147 [2025-01-09 21:24:31,625 INFO L175 Difference]: Start difference. First operand has 480 places, 521 transitions, 1518 flow. Second operand 30 states and 13254 transitions. [2025-01-09 21:24:31,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 538 transitions, 1744 flow [2025-01-09 21:24:31,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 538 transitions, 1734 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:31,632 INFO L231 Difference]: Finished difference. Result has 508 places, 531 transitions, 1660 flow [2025-01-09 21:24:31,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1660, PETRI_PLACES=508, PETRI_TRANSITIONS=531} [2025-01-09 21:24:31,633 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 52 predicate places. [2025-01-09 21:24:31,633 INFO L471 AbstractCegarLoop]: Abstraction has has 508 places, 531 transitions, 1660 flow [2025-01-09 21:24:31,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 442.0869565217391) internal successors, (10168), 23 states have internal predecessors, (10168), 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:24:31,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:31,635 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:31,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:24:31,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:31,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:31,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1123147414, now seen corresponding path program 2 times [2025-01-09 21:24:31,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:31,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808982563] [2025-01-09 21:24:31,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:31,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:31,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1276 statements into 2 equivalence classes. [2025-01-09 21:24:31,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 216 of 1276 statements. [2025-01-09 21:24:31,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:31,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4880 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4880 trivial. 0 not checked. [2025-01-09 21:24:32,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:32,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808982563] [2025-01-09 21:24:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808982563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:32,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:32,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:32,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226823248] [2025-01-09 21:24:32,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:32,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:32,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:32,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:32,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:32,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 457 [2025-01-09 21:24:32,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 531 transitions, 1660 flow. Second operand has 6 states, 6 states have (on average 381.1666666666667) internal successors, (2287), 6 states have internal predecessors, (2287), 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:24:32,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:32,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 457 [2025-01-09 21:24:32,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:34,023 INFO L124 PetriNetUnfolderBase]: 545/3579 cut-off events. [2025-01-09 21:24:34,023 INFO L125 PetriNetUnfolderBase]: For 935/1028 co-relation queries the response was YES. [2025-01-09 21:24:34,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6089 conditions, 3579 events. 545/3579 cut-off events. For 935/1028 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16108 event pairs, 93 based on Foata normal form. 16/3430 useless extension candidates. Maximal degree in co-relation 4524. Up to 1089 conditions per place. [2025-01-09 21:24:34,036 INFO L140 encePairwiseOnDemand]: 434/457 looper letters, 155 selfloop transitions, 130 changer transitions 0/668 dead transitions. [2025-01-09 21:24:34,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 668 transitions, 2880 flow [2025-01-09 21:24:34,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2387 transitions. [2025-01-09 21:24:34,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8705324580598104 [2025-01-09 21:24:34,038 INFO L175 Difference]: Start difference. First operand has 508 places, 531 transitions, 1660 flow. Second operand 6 states and 2387 transitions. [2025-01-09 21:24:34,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 668 transitions, 2880 flow [2025-01-09 21:24:34,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 668 transitions, 2834 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-01-09 21:24:34,050 INFO L231 Difference]: Finished difference. Result has 500 places, 660 transitions, 2842 flow [2025-01-09 21:24:34,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1614, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2842, PETRI_PLACES=500, PETRI_TRANSITIONS=660} [2025-01-09 21:24:34,051 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 44 predicate places. [2025-01-09 21:24:34,051 INFO L471 AbstractCegarLoop]: Abstraction has has 500 places, 660 transitions, 2842 flow [2025-01-09 21:24:34,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 381.1666666666667) internal successors, (2287), 6 states have internal predecessors, (2287), 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:24:34,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:34,052 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:34,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:24:34,052 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:34,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:34,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1151265894, now seen corresponding path program 1 times [2025-01-09 21:24:34,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:34,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647409317] [2025-01-09 21:24:34,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:34,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:34,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1286 statements into 1 equivalence classes. [2025-01-09 21:24:34,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1286 of 1286 statements. [2025-01-09 21:24:34,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:34,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 21:24:37,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:37,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647409317] [2025-01-09 21:24:37,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647409317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:37,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:37,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:37,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210188253] [2025-01-09 21:24:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:37,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:37,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:37,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:37,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:37,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 457 [2025-01-09 21:24:37,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 660 transitions, 2842 flow. Second operand has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 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:24:37,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:37,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 457 [2025-01-09 21:24:37,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:38,694 INFO L124 PetriNetUnfolderBase]: 821/4345 cut-off events. [2025-01-09 21:24:38,695 INFO L125 PetriNetUnfolderBase]: For 3315/3529 co-relation queries the response was YES. [2025-01-09 21:24:38,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8947 conditions, 4345 events. 821/4345 cut-off events. For 3315/3529 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22261 event pairs, 74 based on Foata normal form. 76/4246 useless extension candidates. Maximal degree in co-relation 7399. Up to 1348 conditions per place. [2025-01-09 21:24:38,708 INFO L140 encePairwiseOnDemand]: 434/457 looper letters, 276 selfloop transitions, 131 changer transitions 5/798 dead transitions. [2025-01-09 21:24:38,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 798 transitions, 4566 flow [2025-01-09 21:24:38,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2383 transitions. [2025-01-09 21:24:38,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8690736688548505 [2025-01-09 21:24:38,709 INFO L175 Difference]: Start difference. First operand has 500 places, 660 transitions, 2842 flow. Second operand 6 states and 2383 transitions. [2025-01-09 21:24:38,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 798 transitions, 4566 flow [2025-01-09 21:24:38,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 798 transitions, 4566 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:38,722 INFO L231 Difference]: Finished difference. Result has 510 places, 788 transitions, 4322 flow [2025-01-09 21:24:38,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=2842, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4322, PETRI_PLACES=510, PETRI_TRANSITIONS=788} [2025-01-09 21:24:38,722 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 54 predicate places. [2025-01-09 21:24:38,722 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 788 transitions, 4322 flow [2025-01-09 21:24:38,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 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:24:38,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:38,723 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:38,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:24:38,724 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:38,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:38,726 INFO L85 PathProgramCache]: Analyzing trace with hash -552143584, now seen corresponding path program 1 times [2025-01-09 21:24:38,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:38,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918745565] [2025-01-09 21:24:38,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:38,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:38,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1287 statements into 1 equivalence classes. [2025-01-09 21:24:38,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1287 of 1287 statements. [2025-01-09 21:24:38,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:38,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 21:24:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918745565] [2025-01-09 21:24:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918745565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:41,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294250482] [2025-01-09 21:24:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:41,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:41,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:41,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 457 [2025-01-09 21:24:41,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 788 transitions, 4322 flow. Second operand has 6 states, 6 states have (on average 348.3333333333333) internal successors, (2090), 6 states have internal predecessors, (2090), 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:24:41,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:41,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 457 [2025-01-09 21:24:41,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:43,251 INFO L124 PetriNetUnfolderBase]: 1308/5674 cut-off events. [2025-01-09 21:24:43,251 INFO L125 PetriNetUnfolderBase]: For 4851/4908 co-relation queries the response was YES. [2025-01-09 21:24:43,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13603 conditions, 5674 events. 1308/5674 cut-off events. For 4851/4908 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33835 event pairs, 369 based on Foata normal form. 11/5440 useless extension candidates. Maximal degree in co-relation 11971. Up to 2589 conditions per place. [2025-01-09 21:24:43,271 INFO L140 encePairwiseOnDemand]: 438/457 looper letters, 356 selfloop transitions, 84 changer transitions 0/867 dead transitions. [2025-01-09 21:24:43,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 867 transitions, 5600 flow [2025-01-09 21:24:43,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2186 transitions. [2025-01-09 21:24:43,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972283005105762 [2025-01-09 21:24:43,274 INFO L175 Difference]: Start difference. First operand has 510 places, 788 transitions, 4322 flow. Second operand 6 states and 2186 transitions. [2025-01-09 21:24:43,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 867 transitions, 5600 flow [2025-01-09 21:24:43,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 867 transitions, 5346 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:43,297 INFO L231 Difference]: Finished difference. Result has 519 places, 859 transitions, 4858 flow [2025-01-09 21:24:43,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=4074, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4858, PETRI_PLACES=519, PETRI_TRANSITIONS=859} [2025-01-09 21:24:43,297 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 63 predicate places. [2025-01-09 21:24:43,297 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 859 transitions, 4858 flow [2025-01-09 21:24:43,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 348.3333333333333) internal successors, (2090), 6 states have internal predecessors, (2090), 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:24:43,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:43,298 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:43,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:24:43,299 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:24:43,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:43,302 INFO L85 PathProgramCache]: Analyzing trace with hash -72821436, now seen corresponding path program 1 times [2025-01-09 21:24:43,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:43,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873737988] [2025-01-09 21:24:43,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:43,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:43,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1293 statements into 1 equivalence classes. [2025-01-09 21:24:46,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1293 of 1293 statements. [2025-01-09 21:24:46,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:46,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 414 proven. 2533 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2025-01-09 21:25:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873737988] [2025-01-09 21:25:09,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873737988] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889252867] [2025-01-09 21:25:09,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:09,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:09,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:09,670 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:25:09,671 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:25:10,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1293 statements into 1 equivalence classes. [2025-01-09 21:25:11,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1293 of 1293 statements. [2025-01-09 21:25:11,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:11,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:11,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 4988 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-01-09 21:25:11,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:11,354 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 21:25:11,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 21:25:11,728 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-01-09 21:25:11,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-01-09 21:25:12,345 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-01-09 21:25:12,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-01-09 21:25:12,674 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-01-09 21:25:12,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-01-09 21:25:13,300 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-01-09 21:25:13,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-01-09 21:25:13,819 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-01-09 21:25:13,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-01-09 21:25:14,688 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-01-09 21:25:14,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-01-09 21:25:15,473 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:15,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:17,066 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:17,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:17,817 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:17,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:19,166 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:19,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:19,865 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-01-09 21:25:19,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2025-01-09 21:25:22,056 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-01-09 21:25:22,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-01-09 21:25:23,312 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2025-01-09 21:25:23,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 46 [2025-01-09 21:25:25,607 INFO L349 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2025-01-09 21:25:25,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2025-01-09 21:25:27,472 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-01-09 21:25:27,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2025-01-09 21:25:30,619 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-01-09 21:25:30,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2025-01-09 21:25:32,247 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-01-09 21:25:32,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2025-01-09 21:25:35,184 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-01-09 21:25:35,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2025-01-09 21:25:36,927 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-01-09 21:25:36,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76