./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:27:19,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:27:19,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:27:19,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:27:19,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:27:19,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:27:19,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:27:19,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:27:19,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:27:19,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:27:19,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:27:19,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:27:19,270 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:27:19,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:27:19,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:27:19,270 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:27:19,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:27:19,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:27:19,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:27:19,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:27:19,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:27:19,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:27:19,271 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:27:19,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:27:19,271 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:27:19,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:27:19,271 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:27:19,271 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:27:19,271 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:27:19,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:27:19,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:27:19,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:19,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:27:19,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:27:19,272 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:27:19,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:27:19,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:27:19,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:27:19,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:27:19,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:27:19,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:27:19,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:27:19,272 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2025-02-06 09:27:19,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:27:19,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:27:19,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:27:19,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:27:19,566 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:27:19,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-02-06 09:27:20,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/108db9a69/40a11db4b6174a3daa9bbae8e90c002e/FLAGffc6e8766 [2025-02-06 09:27:21,025 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:27:21,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-02-06 09:27:21,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/108db9a69/40a11db4b6174a3daa9bbae8e90c002e/FLAGffc6e8766 [2025-02-06 09:27:21,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/108db9a69/40a11db4b6174a3daa9bbae8e90c002e [2025-02-06 09:27:21,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:27:21,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:27:21,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:21,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:27:21,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:27:21,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d9de218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21, skipping insertion in model container [2025-02-06 09:27:21,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:27:21,540 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,541 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,541 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,542 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:21,588 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:27:21,637 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,641 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,641 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,642 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:21,700 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:27:21,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21 WrapperNode [2025-02-06 09:27:21,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:21,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:21,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:27:21,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:27:21,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,743 INFO L138 Inliner]: procedures = 280, calls = 136, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 433 [2025-02-06 09:27:21,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:21,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:27:21,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:27:21,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:27:21,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:27:21,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:27:21,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:27:21,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:27:21,778 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:21,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:21,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:27:21,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:27:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:27:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:27:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:27:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:27:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:27:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:27:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:27:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:27:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:27:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:27:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:27:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:27:21,826 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:27:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:27:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:27:21,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:27:21,827 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:27:21,930 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:27:21,931 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:27:22,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:27:22,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:27:22,473 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:27:22,474 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:27:22,498 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:27:22,498 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:27:22,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:22 BoogieIcfgContainer [2025-02-06 09:27:22,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:27:22,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:27:22,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:27:22,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:27:22,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:27:21" (1/3) ... [2025-02-06 09:27:22,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3985402f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:22, skipping insertion in model container [2025-02-06 09:27:22,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (2/3) ... [2025-02-06 09:27:22,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3985402f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:22, skipping insertion in model container [2025-02-06 09:27:22,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:22" (3/3) ... [2025-02-06 09:27:22,506 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2025-02-06 09:27:22,517 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:27:22,518 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_92-evilcollapse_racing.i that has 2 procedures, 477 locations, 1 initial locations, 11 loop locations, and 23 error locations. [2025-02-06 09:27:22,519 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:27:22,682 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:27:22,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 480 places, 498 transitions, 1003 flow [2025-02-06 09:27:22,889 INFO L124 PetriNetUnfolderBase]: 21/528 cut-off events. [2025-02-06 09:27:22,891 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:27:22,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 528 events. 21/528 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 943 event pairs, 0 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 344. Up to 4 conditions per place. [2025-02-06 09:27:22,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 480 places, 498 transitions, 1003 flow [2025-02-06 09:27:22,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 480 places, 498 transitions, 1003 flow [2025-02-06 09:27:22,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:27:22,927 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;@2fad6c0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:27:22,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-02-06 09:27:22,949 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:27:22,950 INFO L124 PetriNetUnfolderBase]: 0/121 cut-off events. [2025-02-06 09:27:22,950 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:27:22,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:22,951 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] [2025-02-06 09:27:22,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:22,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1222216802, now seen corresponding path program 1 times [2025-02-06 09:27:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:22,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223906816] [2025-02-06 09:27:22,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:22,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:23,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 09:27:23,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 09:27:23,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:23,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:23,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:23,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223906816] [2025-02-06 09:27:23,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223906816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:23,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:23,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:23,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461208718] [2025-02-06 09:27:23,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:23,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:23,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:23,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:23,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:24,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 498 [2025-02-06 09:27:24,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 498 transitions, 1003 flow. Second operand has 6 states, 6 states have (on average 375.3333333333333) internal successors, (2252), 6 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:24,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:24,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 498 [2025-02-06 09:27:24,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:24,817 INFO L124 PetriNetUnfolderBase]: 319/1720 cut-off events. [2025-02-06 09:27:24,817 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-02-06 09:27:24,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2426 conditions, 1720 events. 319/1720 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9735 event pairs, 288 based on Foata normal form. 115/1699 useless extension candidates. Maximal degree in co-relation 1999. Up to 690 conditions per place. [2025-02-06 09:27:24,833 INFO L140 encePairwiseOnDemand]: 471/498 looper letters, 96 selfloop transitions, 10 changer transitions 2/479 dead transitions. [2025-02-06 09:27:24,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 479 transitions, 1177 flow [2025-02-06 09:27:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2367 transitions. [2025-02-06 09:27:24,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7921686746987951 [2025-02-06 09:27:24,858 INFO L175 Difference]: Start difference. First operand has 480 places, 498 transitions, 1003 flow. Second operand 6 states and 2367 transitions. [2025-02-06 09:27:24,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 479 transitions, 1177 flow [2025-02-06 09:27:24,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 479 transitions, 1177 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:27:24,879 INFO L231 Difference]: Finished difference. Result has 481 places, 477 transitions, 981 flow [2025-02-06 09:27:24,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=981, PETRI_PLACES=481, PETRI_TRANSITIONS=477} [2025-02-06 09:27:24,885 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, 1 predicate places. [2025-02-06 09:27:24,885 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 477 transitions, 981 flow [2025-02-06 09:27:24,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.3333333333333) internal successors, (2252), 6 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:24,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:24,889 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] [2025-02-06 09:27:24,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:27:24,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:24,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:24,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2081026036, now seen corresponding path program 1 times [2025-02-06 09:27:24,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:24,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050777060] [2025-02-06 09:27:24,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:24,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:24,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 09:27:24,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 09:27:24,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:24,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:25,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:25,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050777060] [2025-02-06 09:27:25,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050777060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:25,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:25,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:25,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352922354] [2025-02-06 09:27:25,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:25,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:25,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:25,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:25,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:25,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 498 [2025-02-06 09:27:25,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 477 transitions, 981 flow. Second operand has 6 states, 6 states have (on average 375.3333333333333) internal successors, (2252), 6 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:25,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:25,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 498 [2025-02-06 09:27:25,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:26,216 INFO L124 PetriNetUnfolderBase]: 319/1716 cut-off events. [2025-02-06 09:27:26,217 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-02-06 09:27:26,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 1716 events. 319/1716 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9724 event pairs, 288 based on Foata normal form. 0/1584 useless extension candidates. Maximal degree in co-relation 2258. Up to 690 conditions per place. [2025-02-06 09:27:26,224 INFO L140 encePairwiseOnDemand]: 486/498 looper letters, 96 selfloop transitions, 10 changer transitions 0/475 dead transitions. [2025-02-06 09:27:26,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 475 transitions, 1189 flow [2025-02-06 09:27:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2352 transitions. [2025-02-06 09:27:26,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7871485943775101 [2025-02-06 09:27:26,231 INFO L175 Difference]: Start difference. First operand has 481 places, 477 transitions, 981 flow. Second operand 6 states and 2352 transitions. [2025-02-06 09:27:26,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 475 transitions, 1189 flow [2025-02-06 09:27:26,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 475 transitions, 1169 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:26,239 INFO L231 Difference]: Finished difference. Result has 477 places, 475 transitions, 977 flow [2025-02-06 09:27:26,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=977, PETRI_PLACES=477, PETRI_TRANSITIONS=475} [2025-02-06 09:27:26,241 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, -3 predicate places. [2025-02-06 09:27:26,241 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 475 transitions, 977 flow [2025-02-06 09:27:26,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.3333333333333) internal successors, (2252), 6 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:26,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:26,243 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] [2025-02-06 09:27:26,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:27:26,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:26,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1452065672, now seen corresponding path program 1 times [2025-02-06 09:27:26,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:26,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283553613] [2025-02-06 09:27:26,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:26,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:26,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 09:27:26,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 09:27:26,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:26,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:26,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:26,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283553613] [2025-02-06 09:27:26,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283553613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:26,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:26,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:27:26,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555578441] [2025-02-06 09:27:26,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:26,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:26,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:26,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:26,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:26,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 466 out of 498 [2025-02-06 09:27:26,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 475 transitions, 977 flow. Second operand has 3 states, 3 states have (on average 467.3333333333333) internal successors, (1402), 3 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:26,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:26,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 466 of 498 [2025-02-06 09:27:26,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:26,477 INFO L124 PetriNetUnfolderBase]: 15/653 cut-off events. [2025-02-06 09:27:26,477 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-06 09:27:26,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 653 events. 15/653 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1447 event pairs, 8 based on Foata normal form. 1/610 useless extension candidates. Maximal degree in co-relation 487. Up to 34 conditions per place. [2025-02-06 09:27:26,480 INFO L140 encePairwiseOnDemand]: 495/498 looper letters, 15 selfloop transitions, 2 changer transitions 0/476 dead transitions. [2025-02-06 09:27:26,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 476 transitions, 1013 flow [2025-02-06 09:27:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1416 transitions. [2025-02-06 09:27:26,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477911646586346 [2025-02-06 09:27:26,483 INFO L175 Difference]: Start difference. First operand has 477 places, 475 transitions, 977 flow. Second operand 3 states and 1416 transitions. [2025-02-06 09:27:26,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 476 transitions, 1013 flow [2025-02-06 09:27:26,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 476 transitions, 993 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:26,521 INFO L231 Difference]: Finished difference. Result has 475 places, 476 transitions, 969 flow [2025-02-06 09:27:26,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=969, PETRI_PLACES=475, PETRI_TRANSITIONS=476} [2025-02-06 09:27:26,522 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, -5 predicate places. [2025-02-06 09:27:26,523 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 476 transitions, 969 flow [2025-02-06 09:27:26,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.3333333333333) internal successors, (1402), 3 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:26,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:26,524 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] [2025-02-06 09:27:26,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:27:26,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:26,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1651640775, now seen corresponding path program 1 times [2025-02-06 09:27:26,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:26,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542895888] [2025-02-06 09:27:26,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:26,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 09:27:26,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 09:27:26,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:26,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:27,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542895888] [2025-02-06 09:27:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542895888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:27,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:27,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462691338] [2025-02-06 09:27:27,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:27,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:27,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:27,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:27,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:27,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 498 [2025-02-06 09:27:27,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 476 transitions, 969 flow. Second operand has 6 states, 6 states have (on average 375.6666666666667) internal successors, (2254), 6 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:27,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:27,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 498 [2025-02-06 09:27:27,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:27,502 INFO L124 PetriNetUnfolderBase]: 320/1838 cut-off events. [2025-02-06 09:27:27,503 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-02-06 09:27:27,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2599 conditions, 1838 events. 320/1838 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10117 event pairs, 288 based on Foata normal form. 0/1702 useless extension candidates. Maximal degree in co-relation 2322. Up to 738 conditions per place. [2025-02-06 09:27:27,508 INFO L140 encePairwiseOnDemand]: 492/498 looper letters, 103 selfloop transitions, 5 changer transitions 0/475 dead transitions. [2025-02-06 09:27:27,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 475 transitions, 1183 flow [2025-02-06 09:27:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2347 transitions. [2025-02-06 09:27:27,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.785475234270415 [2025-02-06 09:27:27,512 INFO L175 Difference]: Start difference. First operand has 475 places, 476 transitions, 969 flow. Second operand 6 states and 2347 transitions. [2025-02-06 09:27:27,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 475 transitions, 1183 flow [2025-02-06 09:27:27,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 475 transitions, 1181 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:27,517 INFO L231 Difference]: Finished difference. Result has 478 places, 475 transitions, 975 flow [2025-02-06 09:27:27,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=975, PETRI_PLACES=478, PETRI_TRANSITIONS=475} [2025-02-06 09:27:27,519 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, -2 predicate places. [2025-02-06 09:27:27,519 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 475 transitions, 975 flow [2025-02-06 09:27:27,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.6666666666667) internal successors, (2254), 6 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:27,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:27,520 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] [2025-02-06 09:27:27,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:27:27,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:27,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1067121871, now seen corresponding path program 1 times [2025-02-06 09:27:27,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:27,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685959153] [2025-02-06 09:27:27,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:27,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 09:27:27,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 09:27:27,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:27,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:27,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:27,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685959153] [2025-02-06 09:27:27,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685959153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:27,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:27,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:27:27,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178966433] [2025-02-06 09:27:27,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:27,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:27,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:27,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:27,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:27,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 466 out of 498 [2025-02-06 09:27:27,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 475 transitions, 975 flow. Second operand has 3 states, 3 states have (on average 467.3333333333333) internal successors, (1402), 3 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:27,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:27,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 466 of 498 [2025-02-06 09:27:27,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:27,679 INFO L124 PetriNetUnfolderBase]: 15/839 cut-off events. [2025-02-06 09:27:27,679 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-06 09:27:27,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 839 events. 15/839 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1670 event pairs, 8 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 682. Up to 38 conditions per place. [2025-02-06 09:27:27,682 INFO L140 encePairwiseOnDemand]: 495/498 looper letters, 15 selfloop transitions, 2 changer transitions 0/476 dead transitions. [2025-02-06 09:27:27,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 476 transitions, 1011 flow [2025-02-06 09:27:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1416 transitions. [2025-02-06 09:27:27,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477911646586346 [2025-02-06 09:27:27,685 INFO L175 Difference]: Start difference. First operand has 478 places, 475 transitions, 975 flow. Second operand 3 states and 1416 transitions. [2025-02-06 09:27:27,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 476 transitions, 1011 flow [2025-02-06 09:27:27,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 476 transitions, 1001 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:27,691 INFO L231 Difference]: Finished difference. Result has 476 places, 476 transitions, 977 flow [2025-02-06 09:27:27,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=977, PETRI_PLACES=476, PETRI_TRANSITIONS=476} [2025-02-06 09:27:27,692 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, -4 predicate places. [2025-02-06 09:27:27,692 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 476 transitions, 977 flow [2025-02-06 09:27:27,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.3333333333333) internal successors, (1402), 3 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:27,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:27,693 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] [2025-02-06 09:27:27,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:27:27,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:27,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash -5703185, now seen corresponding path program 1 times [2025-02-06 09:27:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385250469] [2025-02-06 09:27:27,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:27,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 09:27:27,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 09:27:27,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:27,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:28,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:28,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385250469] [2025-02-06 09:27:28,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385250469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:28,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:28,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:28,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690393022] [2025-02-06 09:27:28,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:28,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:28,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:28,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:28,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 498 [2025-02-06 09:27:28,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 476 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 414.5) internal successors, (2487), 6 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:28,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:28,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 498 [2025-02-06 09:27:28,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:28,797 INFO L124 PetriNetUnfolderBase]: 83/1165 cut-off events. [2025-02-06 09:27:28,797 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-02-06 09:27:28,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 1165 events. 83/1165 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3633 event pairs, 64 based on Foata normal form. 0/1078 useless extension candidates. Maximal degree in co-relation 978. Up to 315 conditions per place. [2025-02-06 09:27:28,801 INFO L140 encePairwiseOnDemand]: 492/498 looper letters, 66 selfloop transitions, 5 changer transitions 0/475 dead transitions. [2025-02-06 09:27:28,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 475 transitions, 1117 flow [2025-02-06 09:27:28,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2532 transitions. [2025-02-06 09:27:28,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8473895582329317 [2025-02-06 09:27:28,805 INFO L175 Difference]: Start difference. First operand has 476 places, 476 transitions, 977 flow. Second operand 6 states and 2532 transitions. [2025-02-06 09:27:28,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 475 transitions, 1117 flow [2025-02-06 09:27:28,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 475 transitions, 1115 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:28,812 INFO L231 Difference]: Finished difference. Result has 479 places, 475 transitions, 983 flow [2025-02-06 09:27:28,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=983, PETRI_PLACES=479, PETRI_TRANSITIONS=475} [2025-02-06 09:27:28,815 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, -1 predicate places. [2025-02-06 09:27:28,815 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 475 transitions, 983 flow [2025-02-06 09:27:28,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 414.5) internal successors, (2487), 6 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:28,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:28,817 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] [2025-02-06 09:27:28,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:27:28,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:28,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1047539858, now seen corresponding path program 1 times [2025-02-06 09:27:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:28,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542051549] [2025-02-06 09:27:28,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:28,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 09:27:28,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 09:27:28,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:28,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:29,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:29,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542051549] [2025-02-06 09:27:29,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542051549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:29,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:29,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:29,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839958785] [2025-02-06 09:27:29,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:29,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:29,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:29,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:29,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:29,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 498 [2025-02-06 09:27:29,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 475 transitions, 983 flow. Second operand has 6 states, 6 states have (on average 378.3333333333333) internal successors, (2270), 6 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:29,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:29,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 498 [2025-02-06 09:27:29,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:30,022 INFO L124 PetriNetUnfolderBase]: 320/2018 cut-off events. [2025-02-06 09:27:30,022 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-02-06 09:27:30,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 2018 events. 320/2018 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10744 event pairs, 288 based on Foata normal form. 0/1882 useless extension candidates. Maximal degree in co-relation 2365. Up to 804 conditions per place. [2025-02-06 09:27:30,031 INFO L140 encePairwiseOnDemand]: 492/498 looper letters, 103 selfloop transitions, 5 changer transitions 0/474 dead transitions. [2025-02-06 09:27:30,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 474 transitions, 1197 flow [2025-02-06 09:27:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2347 transitions. [2025-02-06 09:27:30,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.785475234270415 [2025-02-06 09:27:30,037 INFO L175 Difference]: Start difference. First operand has 479 places, 475 transitions, 983 flow. Second operand 6 states and 2347 transitions. [2025-02-06 09:27:30,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 474 transitions, 1197 flow [2025-02-06 09:27:30,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 474 transitions, 1187 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:30,044 INFO L231 Difference]: Finished difference. Result has 478 places, 474 transitions, 981 flow [2025-02-06 09:27:30,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=981, PETRI_PLACES=478, PETRI_TRANSITIONS=474} [2025-02-06 09:27:30,047 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, -2 predicate places. [2025-02-06 09:27:30,047 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 474 transitions, 981 flow [2025-02-06 09:27:30,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 378.3333333333333) internal successors, (2270), 6 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:30,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:30,049 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] [2025-02-06 09:27:30,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:27:30,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:30,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1168064018, now seen corresponding path program 1 times [2025-02-06 09:27:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621007979] [2025-02-06 09:27:30,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:30,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 09:27:30,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 09:27:30,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:30,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:30,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621007979] [2025-02-06 09:27:30,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621007979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:30,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:30,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836804225] [2025-02-06 09:27:30,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:30,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:30,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:30,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:30,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:30,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 498 [2025-02-06 09:27:30,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 474 transitions, 981 flow. Second operand has 6 states, 6 states have (on average 383.0) internal successors, (2298), 6 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:30,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:30,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 498 [2025-02-06 09:27:30,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:31,021 INFO L124 PetriNetUnfolderBase]: 320/2014 cut-off events. [2025-02-06 09:27:31,021 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-02-06 09:27:31,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 2014 events. 320/2014 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10729 event pairs, 288 based on Foata normal form. 0/1882 useless extension candidates. Maximal degree in co-relation 2381. Up to 788 conditions per place. [2025-02-06 09:27:31,028 INFO L140 encePairwiseOnDemand]: 492/498 looper letters, 99 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-02-06 09:27:31,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 473 transitions, 1187 flow [2025-02-06 09:27:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2367 transitions. [2025-02-06 09:27:31,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7921686746987951 [2025-02-06 09:27:31,032 INFO L175 Difference]: Start difference. First operand has 478 places, 474 transitions, 981 flow. Second operand 6 states and 2367 transitions. [2025-02-06 09:27:31,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 473 transitions, 1187 flow [2025-02-06 09:27:31,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 473 transitions, 1177 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:31,037 INFO L231 Difference]: Finished difference. Result has 477 places, 473 transitions, 979 flow [2025-02-06 09:27:31,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=979, PETRI_PLACES=477, PETRI_TRANSITIONS=473} [2025-02-06 09:27:31,039 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, -3 predicate places. [2025-02-06 09:27:31,039 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 473 transitions, 979 flow [2025-02-06 09:27:31,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 383.0) internal successors, (2298), 6 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:31,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:31,040 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] [2025-02-06 09:27:31,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:27:31,040 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:31,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1044431259, now seen corresponding path program 1 times [2025-02-06 09:27:31,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:31,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996523904] [2025-02-06 09:27:31,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:31,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-06 09:27:31,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-06 09:27:31,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:31,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:27:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:31,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996523904] [2025-02-06 09:27:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996523904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:31,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:31,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886320713] [2025-02-06 09:27:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:31,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:31,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:31,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:31,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:31,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 498 [2025-02-06 09:27:31,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 473 transitions, 979 flow. Second operand has 6 states, 6 states have (on average 383.0) internal successors, (2298), 6 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:31,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:31,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 498 [2025-02-06 09:27:31,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:32,052 INFO L124 PetriNetUnfolderBase]: 320/2010 cut-off events. [2025-02-06 09:27:32,052 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-02-06 09:27:32,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 2010 events. 320/2010 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10723 event pairs, 288 based on Foata normal form. 0/1882 useless extension candidates. Maximal degree in co-relation 2396. Up to 788 conditions per place. [2025-02-06 09:27:32,058 INFO L140 encePairwiseOnDemand]: 492/498 looper letters, 99 selfloop transitions, 5 changer transitions 0/472 dead transitions. [2025-02-06 09:27:32,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 472 transitions, 1185 flow [2025-02-06 09:27:32,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2367 transitions. [2025-02-06 09:27:32,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7921686746987951 [2025-02-06 09:27:32,061 INFO L175 Difference]: Start difference. First operand has 477 places, 473 transitions, 979 flow. Second operand 6 states and 2367 transitions. [2025-02-06 09:27:32,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 472 transitions, 1185 flow [2025-02-06 09:27:32,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 472 transitions, 1175 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:32,066 INFO L231 Difference]: Finished difference. Result has 476 places, 472 transitions, 977 flow [2025-02-06 09:27:32,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=977, PETRI_PLACES=476, PETRI_TRANSITIONS=472} [2025-02-06 09:27:32,068 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, -4 predicate places. [2025-02-06 09:27:32,068 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 472 transitions, 977 flow [2025-02-06 09:27:32,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 383.0) internal successors, (2298), 6 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:32,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:32,069 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] [2025-02-06 09:27:32,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:27:32,070 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:32,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:32,070 INFO L85 PathProgramCache]: Analyzing trace with hash 767830288, now seen corresponding path program 1 times [2025-02-06 09:27:32,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:32,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447127225] [2025-02-06 09:27:32,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:32,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:32,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 09:27:32,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 09:27:32,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:32,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:27:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:32,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447127225] [2025-02-06 09:27:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447127225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910090569] [2025-02-06 09:27:32,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:32,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:32,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:32,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:32,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:32,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 498 [2025-02-06 09:27:32,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 472 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 379.5) internal successors, (2277), 6 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:32,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:32,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 498 [2025-02-06 09:27:32,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:33,049 INFO L124 PetriNetUnfolderBase]: 320/2006 cut-off events. [2025-02-06 09:27:33,050 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-02-06 09:27:33,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 2006 events. 320/2006 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10681 event pairs, 288 based on Foata normal form. 0/1882 useless extension candidates. Maximal degree in co-relation 2409. Up to 808 conditions per place. [2025-02-06 09:27:33,057 INFO L140 encePairwiseOnDemand]: 492/498 looper letters, 104 selfloop transitions, 5 changer transitions 0/471 dead transitions. [2025-02-06 09:27:33,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 471 transitions, 1193 flow [2025-02-06 09:27:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2342 transitions. [2025-02-06 09:27:33,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7838018741633199 [2025-02-06 09:27:33,061 INFO L175 Difference]: Start difference. First operand has 476 places, 472 transitions, 977 flow. Second operand 6 states and 2342 transitions. [2025-02-06 09:27:33,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 471 transitions, 1193 flow [2025-02-06 09:27:33,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 471 transitions, 1183 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:33,068 INFO L231 Difference]: Finished difference. Result has 475 places, 471 transitions, 975 flow [2025-02-06 09:27:33,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=975, PETRI_PLACES=475, PETRI_TRANSITIONS=471} [2025-02-06 09:27:33,069 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, -5 predicate places. [2025-02-06 09:27:33,070 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 471 transitions, 975 flow [2025-02-06 09:27:33,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.5) internal successors, (2277), 6 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:33,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:33,071 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:33,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:27:33,072 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:33,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1170783333, now seen corresponding path program 1 times [2025-02-06 09:27:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:33,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972961663] [2025-02-06 09:27:33,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:33,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-06 09:27:33,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-06 09:27:33,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:33,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:27:33,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:33,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972961663] [2025-02-06 09:27:33,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972961663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:27:33,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340328786] [2025-02-06 09:27:33,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:33,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:27:33,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:33,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:27:33,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:27:33,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-06 09:27:33,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-06 09:27:33,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:33,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:33,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:27:33,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:27:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:27:33,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:27:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:27:33,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340328786] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:27:33,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:27:33,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:27:33,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032073293] [2025-02-06 09:27:33,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:27:33,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:27:33,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:33,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:27:33,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:27:33,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 498 [2025-02-06 09:27:33,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 471 transitions, 975 flow. Second operand has 10 states, 10 states have (on average 464.8) internal successors, (4648), 10 states have internal predecessors, (4648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:33,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:33,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 498 [2025-02-06 09:27:33,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:33,902 INFO L124 PetriNetUnfolderBase]: 15/1003 cut-off events. [2025-02-06 09:27:33,902 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-02-06 09:27:33,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 1003 events. 15/1003 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1216 event pairs, 8 based on Foata normal form. 4/977 useless extension candidates. Maximal degree in co-relation 888. Up to 38 conditions per place. [2025-02-06 09:27:33,905 INFO L140 encePairwiseOnDemand]: 492/498 looper letters, 19 selfloop transitions, 9 changer transitions 0/479 dead transitions. [2025-02-06 09:27:33,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 479 transitions, 1049 flow [2025-02-06 09:27:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:27:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:27:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4197 transitions. [2025-02-06 09:27:33,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9364123159303882 [2025-02-06 09:27:33,911 INFO L175 Difference]: Start difference. First operand has 475 places, 471 transitions, 975 flow. Second operand 9 states and 4197 transitions. [2025-02-06 09:27:33,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 479 transitions, 1049 flow [2025-02-06 09:27:33,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 479 transitions, 1039 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:33,917 INFO L231 Difference]: Finished difference. Result has 481 places, 477 transitions, 1015 flow [2025-02-06 09:27:33,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1015, PETRI_PLACES=481, PETRI_TRANSITIONS=477} [2025-02-06 09:27:33,918 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, 1 predicate places. [2025-02-06 09:27:33,918 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 477 transitions, 1015 flow [2025-02-06 09:27:33,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 464.8) internal successors, (4648), 10 states have internal predecessors, (4648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:33,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:33,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:33,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:27:34,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 09:27:34,126 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:34,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:34,129 INFO L85 PathProgramCache]: Analyzing trace with hash -374408141, now seen corresponding path program 2 times [2025-02-06 09:27:34,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:34,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610235636] [2025-02-06 09:27:34,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:27:34,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:34,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 422 statements into 2 equivalence classes. [2025-02-06 09:27:34,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 123 of 422 statements. [2025-02-06 09:27:34,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:27:34,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2025-02-06 09:27:34,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:34,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610235636] [2025-02-06 09:27:34,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610235636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:34,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:34,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:34,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445213017] [2025-02-06 09:27:34,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:34,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:34,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:34,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:34,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:35,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 498 [2025-02-06 09:27:35,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 477 transitions, 1015 flow. Second operand has 6 states, 6 states have (on average 408.3333333333333) internal successors, (2450), 6 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:35,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:35,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 498 [2025-02-06 09:27:35,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:35,777 INFO L124 PetriNetUnfolderBase]: 83/1331 cut-off events. [2025-02-06 09:27:35,777 INFO L125 PetriNetUnfolderBase]: For 18/22 co-relation queries the response was YES. [2025-02-06 09:27:35,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 1331 events. 83/1331 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3162 event pairs, 64 based on Foata normal form. 0/1258 useless extension candidates. Maximal degree in co-relation 1107. Up to 362 conditions per place. [2025-02-06 09:27:35,782 INFO L140 encePairwiseOnDemand]: 486/498 looper letters, 69 selfloop transitions, 10 changer transitions 0/475 dead transitions. [2025-02-06 09:27:35,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 475 transitions, 1169 flow [2025-02-06 09:27:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2025-02-06 09:27:35,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8323293172690763 [2025-02-06 09:27:35,786 INFO L175 Difference]: Start difference. First operand has 481 places, 477 transitions, 1015 flow. Second operand 6 states and 2487 transitions. [2025-02-06 09:27:35,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 475 transitions, 1169 flow [2025-02-06 09:27:35,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 475 transitions, 1163 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:35,793 INFO L231 Difference]: Finished difference. Result has 483 places, 475 transitions, 1025 flow [2025-02-06 09:27:35,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1025, PETRI_PLACES=483, PETRI_TRANSITIONS=475} [2025-02-06 09:27:35,794 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, 3 predicate places. [2025-02-06 09:27:35,794 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 475 transitions, 1025 flow [2025-02-06 09:27:35,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 408.3333333333333) internal successors, (2450), 6 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:35,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:35,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:35,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:27:35,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:35,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash 354306277, now seen corresponding path program 1 times [2025-02-06 09:27:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:35,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893947974] [2025-02-06 09:27:35,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:35,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-02-06 09:27:35,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-02-06 09:27:35,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:35,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-02-06 09:27:36,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:36,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893947974] [2025-02-06 09:27:36,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893947974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:27:36,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992715871] [2025-02-06 09:27:36,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:36,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:27:36,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:36,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:27:36,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:27:36,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-02-06 09:27:36,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-02-06 09:27:36,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:36,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:36,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:27:36,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:27:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 1 proven. 363 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 09:27:36,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:27:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 1 proven. 363 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 09:27:37,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992715871] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:27:37,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:27:37,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-06 09:27:37,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345035642] [2025-02-06 09:27:37,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:27:37,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 09:27:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:37,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 09:27:37,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-06 09:27:37,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 498 [2025-02-06 09:27:37,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 475 transitions, 1025 flow. Second operand has 19 states, 19 states have (on average 459.5263157894737) internal successors, (8731), 19 states have internal predecessors, (8731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:37,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:37,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 498 [2025-02-06 09:27:37,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:38,413 INFO L124 PetriNetUnfolderBase]: 16/2381 cut-off events. [2025-02-06 09:27:38,414 INFO L125 PetriNetUnfolderBase]: For 81/82 co-relation queries the response was YES. [2025-02-06 09:27:38,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682 conditions, 2381 events. 16/2381 cut-off events. For 81/82 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1205 event pairs, 8 based on Foata normal form. 13/2366 useless extension candidates. Maximal degree in co-relation 2450. Up to 40 conditions per place. [2025-02-06 09:27:38,418 INFO L140 encePairwiseOnDemand]: 487/498 looper letters, 51 selfloop transitions, 68 changer transitions 0/561 dead transitions. [2025-02-06 09:27:38,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 561 transitions, 1673 flow [2025-02-06 09:27:38,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-02-06 09:27:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-02-06 09:27:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 28923 transitions. [2025-02-06 09:27:38,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218779881430483 [2025-02-06 09:27:38,442 INFO L175 Difference]: Start difference. First operand has 483 places, 475 transitions, 1025 flow. Second operand 63 states and 28923 transitions. [2025-02-06 09:27:38,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 561 transitions, 1673 flow [2025-02-06 09:27:38,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 561 transitions, 1653 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:38,449 INFO L231 Difference]: Finished difference. Result has 556 places, 537 transitions, 1525 flow [2025-02-06 09:27:38,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1525, PETRI_PLACES=556, PETRI_TRANSITIONS=537} [2025-02-06 09:27:38,450 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, 76 predicate places. [2025-02-06 09:27:38,451 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 537 transitions, 1525 flow [2025-02-06 09:27:38,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 459.5263157894737) internal successors, (8731), 19 states have internal predecessors, (8731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:38,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:38,457 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:38,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 09:27:38,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:27:38,661 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:38,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1776031312, now seen corresponding path program 2 times [2025-02-06 09:27:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115296228] [2025-02-06 09:27:38,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:27:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:38,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1484 statements into 2 equivalence classes. [2025-02-06 09:27:38,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 166 of 1484 statements. [2025-02-06 09:27:38,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:27:38,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11189 trivial. 0 not checked. [2025-02-06 09:27:39,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:39,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115296228] [2025-02-06 09:27:39,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115296228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:39,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:39,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:39,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134621844] [2025-02-06 09:27:39,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:39,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:39,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:39,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:39,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:39,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 498 [2025-02-06 09:27:39,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 537 transitions, 1525 flow. Second operand has 6 states, 6 states have (on average 417.3333333333333) internal successors, (2504), 6 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:39,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:39,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 498 [2025-02-06 09:27:39,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:40,438 INFO L124 PetriNetUnfolderBase]: 103/2800 cut-off events. [2025-02-06 09:27:40,439 INFO L125 PetriNetUnfolderBase]: For 441/446 co-relation queries the response was YES. [2025-02-06 09:27:40,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3970 conditions, 2800 events. 103/2800 cut-off events. For 441/446 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4142 event pairs, 80 based on Foata normal form. 0/2718 useless extension candidates. Maximal degree in co-relation 3132. Up to 823 conditions per place. [2025-02-06 09:27:40,445 INFO L140 encePairwiseOnDemand]: 492/498 looper letters, 66 selfloop transitions, 5 changer transitions 0/536 dead transitions. [2025-02-06 09:27:40,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 536 transitions, 1665 flow [2025-02-06 09:27:40,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:40,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:40,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2532 transitions. [2025-02-06 09:27:40,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8473895582329317 [2025-02-06 09:27:40,447 INFO L175 Difference]: Start difference. First operand has 556 places, 537 transitions, 1525 flow. Second operand 6 states and 2532 transitions. [2025-02-06 09:27:40,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 536 transitions, 1665 flow [2025-02-06 09:27:40,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 536 transitions, 1589 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-02-06 09:27:40,455 INFO L231 Difference]: Finished difference. Result has 553 places, 536 transitions, 1457 flow [2025-02-06 09:27:40,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1457, PETRI_PLACES=553, PETRI_TRANSITIONS=536} [2025-02-06 09:27:40,456 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, 73 predicate places. [2025-02-06 09:27:40,456 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 536 transitions, 1457 flow [2025-02-06 09:27:40,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.3333333333333) internal successors, (2504), 6 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:40,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:40,458 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:40,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:27:40,458 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:40,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:40,461 INFO L85 PathProgramCache]: Analyzing trace with hash 646996711, now seen corresponding path program 1 times [2025-02-06 09:27:40,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:40,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282765694] [2025-02-06 09:27:40,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:40,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:40,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-02-06 09:27:40,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-02-06 09:27:40,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:40,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-02-06 09:27:42,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282765694] [2025-02-06 09:27:42,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282765694] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:27:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141385535] [2025-02-06 09:27:42,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:42,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:27:42,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:42,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:27:42,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:27:43,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-02-06 09:27:43,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-02-06 09:27:43,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:43,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:44,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 5801 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:27:44,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:27:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-02-06 09:27:44,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:27:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-02-06 09:27:45,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141385535] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:27:45,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:27:45,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-02-06 09:27:45,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791574445] [2025-02-06 09:27:45,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:27:45,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 09:27:45,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:45,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 09:27:45,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 09:27:45,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 498 [2025-02-06 09:27:45,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 536 transitions, 1457 flow. Second operand has 34 states, 34 states have (on average 465.11764705882354) internal successors, (15814), 34 states have internal predecessors, (15814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:45,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:45,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 498 [2025-02-06 09:27:45,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:47,660 INFO L124 PetriNetUnfolderBase]: 16/4540 cut-off events. [2025-02-06 09:27:47,660 INFO L125 PetriNetUnfolderBase]: For 3212/3213 co-relation queries the response was YES. [2025-02-06 09:27:47,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5336 conditions, 4540 events. 16/4540 cut-off events. For 3212/3213 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1202 event pairs, 8 based on Foata normal form. 24/4537 useless extension candidates. Maximal degree in co-relation 5088. Up to 78 conditions per place. [2025-02-06 09:27:47,666 INFO L140 encePairwiseOnDemand]: 492/498 looper letters, 51 selfloop transitions, 135 changer transitions 0/637 dead transitions. [2025-02-06 09:27:47,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 637 transitions, 2593 flow [2025-02-06 09:27:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-06 09:27:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-02-06 09:27:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 20919 transitions. [2025-02-06 09:27:47,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9334672021419009 [2025-02-06 09:27:47,682 INFO L175 Difference]: Start difference. First operand has 553 places, 536 transitions, 1457 flow. Second operand 45 states and 20919 transitions. [2025-02-06 09:27:47,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 637 transitions, 2593 flow [2025-02-06 09:27:47,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 637 transitions, 2583 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:47,696 INFO L231 Difference]: Finished difference. Result has 601 places, 611 transitions, 2321 flow [2025-02-06 09:27:47,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2321, PETRI_PLACES=601, PETRI_TRANSITIONS=611} [2025-02-06 09:27:47,697 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, 121 predicate places. [2025-02-06 09:27:47,697 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 611 transitions, 2321 flow [2025-02-06 09:27:47,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 465.11764705882354) internal successors, (15814), 34 states have internal predecessors, (15814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:47,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:47,701 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:47,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 09:27:47,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:27:47,902 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:47,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash 966878439, now seen corresponding path program 2 times [2025-02-06 09:27:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387213185] [2025-02-06 09:27:47,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:27:47,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:48,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2931 statements into 2 equivalence classes. [2025-02-06 09:27:48,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 173 of 2931 statements. [2025-02-06 09:27:48,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:27:48,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52741 trivial. 0 not checked. [2025-02-06 09:27:48,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:48,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387213185] [2025-02-06 09:27:48,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387213185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:48,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:48,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:48,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153622005] [2025-02-06 09:27:48,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:48,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:48,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:48,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:48,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:48,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 498 [2025-02-06 09:27:48,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 611 transitions, 2321 flow. Second operand has 6 states, 6 states have (on average 382.1666666666667) internal successors, (2293), 6 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:48,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:48,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 498 [2025-02-06 09:27:48,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:51,848 INFO L124 PetriNetUnfolderBase]: 360/5878 cut-off events. [2025-02-06 09:27:51,849 INFO L125 PetriNetUnfolderBase]: For 1234/1243 co-relation queries the response was YES. [2025-02-06 09:27:51,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8876 conditions, 5878 events. 360/5878 cut-off events. For 1234/1243 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 12167 event pairs, 324 based on Foata normal form. 0/5746 useless extension candidates. Maximal degree in co-relation 6602. Up to 2196 conditions per place. [2025-02-06 09:27:51,861 INFO L140 encePairwiseOnDemand]: 492/498 looper letters, 104 selfloop transitions, 5 changer transitions 0/610 dead transitions. [2025-02-06 09:27:51,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 610 transitions, 2537 flow [2025-02-06 09:27:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2342 transitions. [2025-02-06 09:27:51,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7838018741633199 [2025-02-06 09:27:51,863 INFO L175 Difference]: Start difference. First operand has 601 places, 611 transitions, 2321 flow. Second operand 6 states and 2342 transitions. [2025-02-06 09:27:51,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 610 transitions, 2537 flow [2025-02-06 09:27:51,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 610 transitions, 2429 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-02-06 09:27:51,881 INFO L231 Difference]: Finished difference. Result has 587 places, 610 transitions, 2221 flow [2025-02-06 09:27:51,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=2211, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2221, PETRI_PLACES=587, PETRI_TRANSITIONS=610} [2025-02-06 09:27:51,883 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, 107 predicate places. [2025-02-06 09:27:51,883 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 610 transitions, 2221 flow [2025-02-06 09:27:51,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 382.1666666666667) internal successors, (2293), 6 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:51,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:51,884 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:51,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:27:51,885 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:51,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:51,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1737495970, now seen corresponding path program 1 times [2025-02-06 09:27:51,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:51,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461456348] [2025-02-06 09:27:51,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:51,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:52,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-02-06 09:27:52,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-02-06 09:27:52,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:52,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 52921 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52921 trivial. 0 not checked. [2025-02-06 09:27:56,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:56,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461456348] [2025-02-06 09:27:56,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461456348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:56,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:56,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:27:56,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48626905] [2025-02-06 09:27:56,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:56,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:56,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:56,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:56,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:56,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 466 out of 498 [2025-02-06 09:27:56,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 610 transitions, 2221 flow. Second operand has 3 states, 3 states have (on average 467.3333333333333) internal successors, (1402), 3 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:56,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:56,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 466 of 498 [2025-02-06 09:27:56,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:58,020 INFO L124 PetriNetUnfolderBase]: 39/4808 cut-off events. [2025-02-06 09:27:58,021 INFO L125 PetriNetUnfolderBase]: For 1199/1203 co-relation queries the response was YES. [2025-02-06 09:27:58,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5638 conditions, 4808 events. 39/4808 cut-off events. For 1199/1203 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3154 event pairs, 0 based on Foata normal form. 2/4748 useless extension candidates. Maximal degree in co-relation 5041. Up to 78 conditions per place. [2025-02-06 09:27:58,028 INFO L140 encePairwiseOnDemand]: 495/498 looper letters, 22 selfloop transitions, 2 changer transitions 0/618 dead transitions. [2025-02-06 09:27:58,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 618 transitions, 2285 flow [2025-02-06 09:27:58,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1423 transitions. [2025-02-06 09:27:58,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9524765729585006 [2025-02-06 09:27:58,032 INFO L175 Difference]: Start difference. First operand has 587 places, 610 transitions, 2221 flow. Second operand 3 states and 1423 transitions. [2025-02-06 09:27:58,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 618 transitions, 2285 flow [2025-02-06 09:27:58,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 618 transitions, 2275 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:58,048 INFO L231 Difference]: Finished difference. Result has 585 places, 610 transitions, 2219 flow [2025-02-06 09:27:58,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=498, PETRI_DIFFERENCE_MINUEND_FLOW=2211, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2219, PETRI_PLACES=585, PETRI_TRANSITIONS=610} [2025-02-06 09:27:58,048 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, 105 predicate places. [2025-02-06 09:27:58,049 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 610 transitions, 2219 flow [2025-02-06 09:27:58,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.3333333333333) internal successors, (1402), 3 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:58,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:58,050 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:58,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:27:58,050 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:27:58,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1135022985, now seen corresponding path program 1 times [2025-02-06 09:27:58,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:58,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673088818] [2025-02-06 09:27:58,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:58,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:58,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-02-06 09:27:58,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-02-06 09:27:58,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:58,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 52921 backedges. 27146 proven. 12615 refuted. 0 times theorem prover too weak. 13160 trivial. 0 not checked. [2025-02-06 09:28:09,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:09,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673088818] [2025-02-06 09:28:09,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673088818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:28:09,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784254274] [2025-02-06 09:28:09,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:09,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:28:09,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:28:09,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:28:09,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:28:11,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-02-06 09:28:12,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-02-06 09:28:12,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:12,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:12,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 11747 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 09:28:12,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:28:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 52921 backedges. 27146 proven. 12615 refuted. 0 times theorem prover too weak. 13160 trivial. 0 not checked. [2025-02-06 09:28:13,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:28:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 52921 backedges. 27146 proven. 12615 refuted. 0 times theorem prover too weak. 13160 trivial. 0 not checked. [2025-02-06 09:28:15,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784254274] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:28:15,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:28:15,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-02-06 09:28:15,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567866732] [2025-02-06 09:28:15,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:28:15,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-02-06 09:28:15,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:15,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-02-06 09:28:15,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-02-06 09:28:15,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 498 [2025-02-06 09:28:15,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 610 transitions, 2219 flow. Second operand has 63 states, 63 states have (on average 465.0952380952381) internal successors, (29301), 63 states have internal predecessors, (29301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:15,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:15,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 498 [2025-02-06 09:28:15,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand