./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 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-735b3cc-m [2025-03-14 01:41:37,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:41:37,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:41:37,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:41:37,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:41:37,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:41:37,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:41:37,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:41:37,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:41:37,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:41:37,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:41:37,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:41:37,920 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:41:37,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:41:37,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:41:37,920 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:41:37,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:41:37,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:41:37,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:41:37,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:41:37,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:41:37,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:41:37,920 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:41:37,920 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:41:37,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:41:37,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:41:37,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:41:37,921 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/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-03-14 01:41:38,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:41:38,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:41:38,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:41:38,146 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:41:38,146 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:41:38,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-03-14 01:41:39,311 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174590e80/893a8dc075cc47419341fbdfa8e15519/FLAGf2f642baf [2025-03-14 01:41:39,599 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:41:39,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-03-14 01:41:39,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174590e80/893a8dc075cc47419341fbdfa8e15519/FLAGf2f642baf [2025-03-14 01:41:39,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174590e80/893a8dc075cc47419341fbdfa8e15519 [2025-03-14 01:41:39,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:41:39,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:41:39,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:41:39,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:41:39,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:41:39,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:41:39" (1/1) ... [2025-03-14 01:41:39,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bb8daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:39, skipping insertion in model container [2025-03-14 01:41:39,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:41:39" (1/1) ... [2025-03-14 01:41:39,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:41:40,281 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:41:40,285 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:41:40,286 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:41:40,286 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:41:40,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:41:40,341 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:41:40,382 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:41:40,386 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:41:40,386 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:41:40,388 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:41:40,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:41:40,454 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:41:40,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40 WrapperNode [2025-03-14 01:41:40,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:41:40,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:41:40,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:41:40,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:41:40,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (1/1) ... [2025-03-14 01:41:40,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (1/1) ... [2025-03-14 01:41:40,510 INFO L138 Inliner]: procedures = 280, calls = 136, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 433 [2025-03-14 01:41:40,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:41:40,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:41:40,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:41:40,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:41:40,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (1/1) ... [2025-03-14 01:41:40,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (1/1) ... [2025-03-14 01:41:40,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (1/1) ... [2025-03-14 01:41:40,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (1/1) ... [2025-03-14 01:41:40,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (1/1) ... [2025-03-14 01:41:40,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (1/1) ... [2025-03-14 01:41:40,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (1/1) ... [2025-03-14 01:41:40,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (1/1) ... [2025-03-14 01:41:40,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:41:40,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:41:40,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:41:40,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:41:40,574 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (1/1) ... [2025-03-14 01:41:40,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:41:40,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:41:40,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:41:40,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:41:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:41:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:41:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:41:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 01:41:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:41:40,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:41:40,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:41:40,621 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:41:40,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:41:40,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:41:40,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:41:40,621 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:41:40,621 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:41:40,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:41:40,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:41:40,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:41:40,623 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:41:40,740 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:41:40,742 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:41:41,193 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-14 01:41:41,194 INFO L1326 $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-03-14 01:41:41,299 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:41:41,301 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:41:41,301 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:41:41,328 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:41:41,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:41:41 BoogieIcfgContainer [2025-03-14 01:41:41,329 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:41:41,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:41:41,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:41:41,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:41:41,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:41:39" (1/3) ... [2025-03-14 01:41:41,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be3f0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:41:41, skipping insertion in model container [2025-03-14 01:41:41,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:41:40" (2/3) ... [2025-03-14 01:41:41,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be3f0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:41:41, skipping insertion in model container [2025-03-14 01:41:41,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:41:41" (3/3) ... [2025-03-14 01:41:41,335 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2025-03-14 01:41:41,344 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:41:41,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_92-evilcollapse_racing.i that has 2 procedures, 473 locations, 1 initial locations, 10 loop locations, and 23 error locations. [2025-03-14 01:41:41,345 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:41:41,416 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:41:41,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 476 places, 494 transitions, 995 flow [2025-03-14 01:41:41,587 INFO L124 PetriNetUnfolderBase]: 21/524 cut-off events. [2025-03-14 01:41:41,589 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:41:41,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 524 events. 21/524 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 948 event pairs, 0 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 344. Up to 4 conditions per place. [2025-03-14 01:41:41,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 476 places, 494 transitions, 995 flow [2025-03-14 01:41:41,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 476 places, 494 transitions, 995 flow [2025-03-14 01:41:41,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:41:41,627 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;@71f0bf59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:41:41,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-14 01:41:41,648 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:41:41,649 INFO L124 PetriNetUnfolderBase]: 0/121 cut-off events. [2025-03-14 01:41:41,649 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:41:41,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:41,650 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-03-14 01:41:41,650 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-03-14 01:41:41,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 104462160, now seen corresponding path program 1 times [2025-03-14 01:41:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:41,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082500060] [2025-03-14 01:41:41,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:41,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:41,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-14 01:41:41,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-14 01:41:41,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:41,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:41:42,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:42,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082500060] [2025-03-14 01:41:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082500060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:42,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:41:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647585045] [2025-03-14 01:41:42,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:42,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:41:42,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:42,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:41:42,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:41:43,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2025-03-14 01:41:43,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 494 transitions, 995 flow. Second operand has 6 states, 6 states have (on average 371.3333333333333) internal successors, (2228), 6 states have internal predecessors, (2228), 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-03-14 01:41:43,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:43,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2025-03-14 01:41:43,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:43,518 INFO L124 PetriNetUnfolderBase]: 319/1684 cut-off events. [2025-03-14 01:41:43,518 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-03-14 01:41:43,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2390 conditions, 1684 events. 319/1684 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9520 event pairs, 288 based on Foata normal form. 79/1627 useless extension candidates. Maximal degree in co-relation 1963. Up to 690 conditions per place. [2025-03-14 01:41:43,534 INFO L140 encePairwiseOnDemand]: 467/494 looper letters, 96 selfloop transitions, 10 changer transitions 2/475 dead transitions. [2025-03-14 01:41:43,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 475 transitions, 1169 flow [2025-03-14 01:41:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:41:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:41:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-14 01:41:43,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-14 01:41:43,561 INFO L175 Difference]: Start difference. First operand has 476 places, 494 transitions, 995 flow. Second operand 6 states and 2343 transitions. [2025-03-14 01:41:43,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 475 transitions, 1169 flow [2025-03-14 01:41:43,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 475 transitions, 1169 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:41:43,583 INFO L231 Difference]: Finished difference. Result has 477 places, 473 transitions, 973 flow [2025-03-14 01:41:43,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, 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=973, PETRI_PLACES=477, PETRI_TRANSITIONS=473} [2025-03-14 01:41:43,590 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 1 predicate places. [2025-03-14 01:41:43,590 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 473 transitions, 973 flow [2025-03-14 01:41:43,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 371.3333333333333) internal successors, (2228), 6 states have internal predecessors, (2228), 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-03-14 01:41:43,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:43,592 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-03-14 01:41:43,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:41:43,592 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-03-14 01:41:43,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1201978236, now seen corresponding path program 1 times [2025-03-14 01:41:43,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:43,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145428282] [2025-03-14 01:41:43,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:43,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-14 01:41:43,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-14 01:41:43,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:43,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:41:44,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:44,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145428282] [2025-03-14 01:41:44,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145428282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:44,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:44,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:41:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974306061] [2025-03-14 01:41:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:44,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:41:44,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:44,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:41:44,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:41:44,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2025-03-14 01:41:44,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 473 transitions, 973 flow. Second operand has 6 states, 6 states have (on average 371.3333333333333) internal successors, (2228), 6 states have internal predecessors, (2228), 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-03-14 01:41:44,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:44,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2025-03-14 01:41:44,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:44,782 INFO L124 PetriNetUnfolderBase]: 319/1680 cut-off events. [2025-03-14 01:41:44,783 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-14 01:41:44,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 1680 events. 319/1680 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9522 event pairs, 288 based on Foata normal form. 0/1548 useless extension candidates. Maximal degree in co-relation 2222. Up to 690 conditions per place. [2025-03-14 01:41:44,790 INFO L140 encePairwiseOnDemand]: 482/494 looper letters, 96 selfloop transitions, 10 changer transitions 0/471 dead transitions. [2025-03-14 01:41:44,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 471 transitions, 1181 flow [2025-03-14 01:41:44,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:41:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:41:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2328 transitions. [2025-03-14 01:41:44,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7854251012145749 [2025-03-14 01:41:44,796 INFO L175 Difference]: Start difference. First operand has 477 places, 473 transitions, 973 flow. Second operand 6 states and 2328 transitions. [2025-03-14 01:41:44,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 471 transitions, 1181 flow [2025-03-14 01:41:44,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 471 transitions, 1161 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:41:44,804 INFO L231 Difference]: Finished difference. Result has 473 places, 471 transitions, 969 flow [2025-03-14 01:41:44,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=969, PETRI_PLACES=473, PETRI_TRANSITIONS=471} [2025-03-14 01:41:44,805 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -3 predicate places. [2025-03-14 01:41:44,805 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 471 transitions, 969 flow [2025-03-14 01:41:44,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 371.3333333333333) internal successors, (2228), 6 states have internal predecessors, (2228), 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-03-14 01:41:44,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:44,806 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-03-14 01:41:44,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:41:44,808 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-03-14 01:41:44,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1791493855, now seen corresponding path program 1 times [2025-03-14 01:41:44,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:44,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621564035] [2025-03-14 01:41:44,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:44,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-14 01:41:44,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-14 01:41:44,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:44,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:41:44,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:44,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621564035] [2025-03-14 01:41:44,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621564035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:44,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:44,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:41:44,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097131539] [2025-03-14 01:41:44,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:44,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:41:44,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:44,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:41:44,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:41:44,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-14 01:41:44,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 471 transitions, 969 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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-03-14 01:41:44,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:44,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-14 01:41:44,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:44,998 INFO L124 PetriNetUnfolderBase]: 15/649 cut-off events. [2025-03-14 01:41:44,998 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-14 01:41:44,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 649 events. 15/649 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1437 event pairs, 8 based on Foata normal form. 1/606 useless extension candidates. Maximal degree in co-relation 487. Up to 34 conditions per place. [2025-03-14 01:41:45,000 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 15 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2025-03-14 01:41:45,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 472 transitions, 1005 flow [2025-03-14 01:41:45,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:41:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:41:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions. [2025-03-14 01:41:45,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-14 01:41:45,003 INFO L175 Difference]: Start difference. First operand has 473 places, 471 transitions, 969 flow. Second operand 3 states and 1404 transitions. [2025-03-14 01:41:45,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 472 transitions, 1005 flow [2025-03-14 01:41:45,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 472 transitions, 985 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:41:45,012 INFO L231 Difference]: Finished difference. Result has 471 places, 472 transitions, 961 flow [2025-03-14 01:41:45,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=961, PETRI_PLACES=471, PETRI_TRANSITIONS=472} [2025-03-14 01:41:45,013 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -5 predicate places. [2025-03-14 01:41:45,013 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 472 transitions, 961 flow [2025-03-14 01:41:45,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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-03-14 01:41:45,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:45,014 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-03-14 01:41:45,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:41:45,014 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-03-14 01:41:45,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:45,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1917540210, now seen corresponding path program 1 times [2025-03-14 01:41:45,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:45,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018053953] [2025-03-14 01:41:45,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:45,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:45,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-14 01:41:45,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-14 01:41:45,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:45,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:41:45,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:45,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018053953] [2025-03-14 01:41:45,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018053953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:45,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:45,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:41:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964427965] [2025-03-14 01:41:45,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:41:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:45,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:41:45,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:41:45,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 494 [2025-03-14 01:41:45,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 472 transitions, 961 flow. Second operand has 6 states, 6 states have (on average 371.6666666666667) internal successors, (2230), 6 states have internal predecessors, (2230), 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-03-14 01:41:45,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:45,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 494 [2025-03-14 01:41:45,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:46,001 INFO L124 PetriNetUnfolderBase]: 320/1802 cut-off events. [2025-03-14 01:41:46,001 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-03-14 01:41:46,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2563 conditions, 1802 events. 320/1802 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9899 event pairs, 288 based on Foata normal form. 0/1666 useless extension candidates. Maximal degree in co-relation 2286. Up to 738 conditions per place. [2025-03-14 01:41:46,013 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 103 selfloop transitions, 5 changer transitions 0/471 dead transitions. [2025-03-14 01:41:46,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 471 transitions, 1175 flow [2025-03-14 01:41:46,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:41:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:41:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2323 transitions. [2025-03-14 01:41:46,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837381916329285 [2025-03-14 01:41:46,019 INFO L175 Difference]: Start difference. First operand has 471 places, 472 transitions, 961 flow. Second operand 6 states and 2323 transitions. [2025-03-14 01:41:46,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 471 transitions, 1175 flow [2025-03-14 01:41:46,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 471 transitions, 1173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:41:46,027 INFO L231 Difference]: Finished difference. Result has 474 places, 471 transitions, 967 flow [2025-03-14 01:41:46,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=469, 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=967, PETRI_PLACES=474, PETRI_TRANSITIONS=471} [2025-03-14 01:41:46,028 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -2 predicate places. [2025-03-14 01:41:46,029 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 471 transitions, 967 flow [2025-03-14 01:41:46,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 371.6666666666667) internal successors, (2230), 6 states have internal predecessors, (2230), 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-03-14 01:41:46,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:46,030 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-03-14 01:41:46,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:41:46,030 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-03-14 01:41:46,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:46,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2115935445, now seen corresponding path program 1 times [2025-03-14 01:41:46,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:46,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711542897] [2025-03-14 01:41:46,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:46,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:46,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-14 01:41:46,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-14 01:41:46,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:46,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:41:46,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711542897] [2025-03-14 01:41:46,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711542897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:46,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:46,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:41:46,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6346287] [2025-03-14 01:41:46,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:46,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:41:46,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:46,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:41:46,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:41:46,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-14 01:41:46,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 471 transitions, 967 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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-03-14 01:41:46,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:46,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-14 01:41:46,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:46,244 INFO L124 PetriNetUnfolderBase]: 15/835 cut-off events. [2025-03-14 01:41:46,244 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-14 01:41:46,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 835 events. 15/835 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1643 event pairs, 8 based on Foata normal form. 2/787 useless extension candidates. Maximal degree in co-relation 682. Up to 38 conditions per place. [2025-03-14 01:41:46,247 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 15 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2025-03-14 01:41:46,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 472 transitions, 1003 flow [2025-03-14 01:41:46,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:41:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:41:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions. [2025-03-14 01:41:46,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-14 01:41:46,250 INFO L175 Difference]: Start difference. First operand has 474 places, 471 transitions, 967 flow. Second operand 3 states and 1404 transitions. [2025-03-14 01:41:46,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 472 transitions, 1003 flow [2025-03-14 01:41:46,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 472 transitions, 993 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:41:46,256 INFO L231 Difference]: Finished difference. Result has 472 places, 472 transitions, 969 flow [2025-03-14 01:41:46,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=969, PETRI_PLACES=472, PETRI_TRANSITIONS=472} [2025-03-14 01:41:46,257 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -4 predicate places. [2025-03-14 01:41:46,257 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 472 transitions, 969 flow [2025-03-14 01:41:46,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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-03-14 01:41:46,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:46,258 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-03-14 01:41:46,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:41:46,258 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-03-14 01:41:46,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash 19709408, now seen corresponding path program 1 times [2025-03-14 01:41:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587068795] [2025-03-14 01:41:46,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:46,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:46,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-14 01:41:46,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-14 01:41:46,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:46,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:41:46,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:46,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587068795] [2025-03-14 01:41:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587068795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:46,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:46,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:41:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251909071] [2025-03-14 01:41:46,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:46,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:41:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:46,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:41:46,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:41:47,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 494 [2025-03-14 01:41:47,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 472 transitions, 969 flow. Second operand has 6 states, 6 states have (on average 410.5) internal successors, (2463), 6 states have internal predecessors, (2463), 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-03-14 01:41:47,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:47,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 494 [2025-03-14 01:41:47,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:47,475 INFO L124 PetriNetUnfolderBase]: 83/1145 cut-off events. [2025-03-14 01:41:47,476 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-03-14 01:41:47,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1145 events. 83/1145 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3542 event pairs, 64 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 958. Up to 315 conditions per place. [2025-03-14 01:41:47,479 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 66 selfloop transitions, 5 changer transitions 0/471 dead transitions. [2025-03-14 01:41:47,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 471 transitions, 1109 flow [2025-03-14 01:41:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:41:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:41:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2508 transitions. [2025-03-14 01:41:47,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2025-03-14 01:41:47,483 INFO L175 Difference]: Start difference. First operand has 472 places, 472 transitions, 969 flow. Second operand 6 states and 2508 transitions. [2025-03-14 01:41:47,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 471 transitions, 1109 flow [2025-03-14 01:41:47,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 471 transitions, 1107 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:41:47,490 INFO L231 Difference]: Finished difference. Result has 475 places, 471 transitions, 975 flow [2025-03-14 01:41:47,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, 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-03-14 01:41:47,493 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -1 predicate places. [2025-03-14 01:41:47,493 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 471 transitions, 975 flow [2025-03-14 01:41:47,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.5) internal successors, (2463), 6 states have internal predecessors, (2463), 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-03-14 01:41:47,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:47,495 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-03-14 01:41:47,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:41:47,495 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-03-14 01:41:47,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash 587467578, now seen corresponding path program 1 times [2025-03-14 01:41:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:47,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397778756] [2025-03-14 01:41:47,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:47,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:47,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-14 01:41:47,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-14 01:41:47,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:47,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:41:47,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:47,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397778756] [2025-03-14 01:41:47,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397778756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:47,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:47,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:41:47,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291846304] [2025-03-14 01:41:47,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:47,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:41:47,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:47,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:41:47,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:41:48,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 494 [2025-03-14 01:41:48,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 471 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 374.3333333333333) internal successors, (2246), 6 states have internal predecessors, (2246), 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-03-14 01:41:48,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:48,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 494 [2025-03-14 01:41:48,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:48,711 INFO L124 PetriNetUnfolderBase]: 320/1982 cut-off events. [2025-03-14 01:41:48,712 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-14 01:41:48,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1982 events. 320/1982 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10501 event pairs, 288 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 2329. Up to 804 conditions per place. [2025-03-14 01:41:48,717 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 103 selfloop transitions, 5 changer transitions 0/470 dead transitions. [2025-03-14 01:41:48,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 470 transitions, 1189 flow [2025-03-14 01:41:48,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:41:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:41:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2323 transitions. [2025-03-14 01:41:48,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837381916329285 [2025-03-14 01:41:48,723 INFO L175 Difference]: Start difference. First operand has 475 places, 471 transitions, 975 flow. Second operand 6 states and 2323 transitions. [2025-03-14 01:41:48,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 470 transitions, 1189 flow [2025-03-14 01:41:48,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 470 transitions, 1179 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:41:48,728 INFO L231 Difference]: Finished difference. Result has 474 places, 470 transitions, 973 flow [2025-03-14 01:41:48,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=973, PETRI_PLACES=474, PETRI_TRANSITIONS=470} [2025-03-14 01:41:48,729 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -2 predicate places. [2025-03-14 01:41:48,729 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 470 transitions, 973 flow [2025-03-14 01:41:48,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 374.3333333333333) internal successors, (2246), 6 states have internal predecessors, (2246), 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-03-14 01:41:48,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:48,730 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-03-14 01:41:48,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:41:48,731 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-03-14 01:41:48,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash -880772235, now seen corresponding path program 1 times [2025-03-14 01:41:48,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:48,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484882887] [2025-03-14 01:41:48,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:48,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-14 01:41:48,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-14 01:41:48,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:48,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:41:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:49,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484882887] [2025-03-14 01:41:49,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484882887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:49,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:49,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:41:49,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646439307] [2025-03-14 01:41:49,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:49,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:41:49,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:49,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:41:49,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:41:49,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 494 [2025-03-14 01:41:49,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 470 transitions, 973 flow. Second operand has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 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-03-14 01:41:49,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:49,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 494 [2025-03-14 01:41:49,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:49,665 INFO L124 PetriNetUnfolderBase]: 320/1978 cut-off events. [2025-03-14 01:41:49,665 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-14 01:41:49,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1978 events. 320/1978 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10485 event pairs, 288 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 2345. Up to 788 conditions per place. [2025-03-14 01:41:49,673 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 99 selfloop transitions, 5 changer transitions 0/469 dead transitions. [2025-03-14 01:41:49,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 469 transitions, 1179 flow [2025-03-14 01:41:49,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:41:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:41:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-14 01:41:49,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-14 01:41:49,677 INFO L175 Difference]: Start difference. First operand has 474 places, 470 transitions, 973 flow. Second operand 6 states and 2343 transitions. [2025-03-14 01:41:49,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 469 transitions, 1179 flow [2025-03-14 01:41:49,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 469 transitions, 1169 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:41:49,684 INFO L231 Difference]: Finished difference. Result has 473 places, 469 transitions, 971 flow [2025-03-14 01:41:49,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=971, PETRI_PLACES=473, PETRI_TRANSITIONS=469} [2025-03-14 01:41:49,685 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -3 predicate places. [2025-03-14 01:41:49,685 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 469 transitions, 971 flow [2025-03-14 01:41:49,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 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-03-14 01:41:49,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:49,686 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-03-14 01:41:49,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:41:49,687 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-03-14 01:41:49,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:49,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1699201572, now seen corresponding path program 1 times [2025-03-14 01:41:49,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:49,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854849107] [2025-03-14 01:41:49,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:49,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:49,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-14 01:41:49,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-14 01:41:49,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:49,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:41:50,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:50,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854849107] [2025-03-14 01:41:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854849107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:50,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:50,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:41:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458901047] [2025-03-14 01:41:50,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:50,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:41:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:50,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:41:50,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:41:50,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 494 [2025-03-14 01:41:50,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 469 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 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-03-14 01:41:50,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:50,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 494 [2025-03-14 01:41:50,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:50,746 INFO L124 PetriNetUnfolderBase]: 320/1974 cut-off events. [2025-03-14 01:41:50,746 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-14 01:41:50,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2823 conditions, 1974 events. 320/1974 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10440 event pairs, 288 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 2360. Up to 788 conditions per place. [2025-03-14 01:41:50,755 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 99 selfloop transitions, 5 changer transitions 0/468 dead transitions. [2025-03-14 01:41:50,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 468 transitions, 1177 flow [2025-03-14 01:41:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:41:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:41:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-14 01:41:50,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-14 01:41:50,759 INFO L175 Difference]: Start difference. First operand has 473 places, 469 transitions, 971 flow. Second operand 6 states and 2343 transitions. [2025-03-14 01:41:50,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 468 transitions, 1177 flow [2025-03-14 01:41:50,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 468 transitions, 1167 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:41:50,765 INFO L231 Difference]: Finished difference. Result has 472 places, 468 transitions, 969 flow [2025-03-14 01:41:50,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=969, PETRI_PLACES=472, PETRI_TRANSITIONS=468} [2025-03-14 01:41:50,767 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -4 predicate places. [2025-03-14 01:41:50,767 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 468 transitions, 969 flow [2025-03-14 01:41:50,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 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-03-14 01:41:50,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:50,768 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-03-14 01:41:50,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:41:50,768 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-03-14 01:41:50,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:50,769 INFO L85 PathProgramCache]: Analyzing trace with hash -924732901, now seen corresponding path program 1 times [2025-03-14 01:41:50,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:50,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051798437] [2025-03-14 01:41:50,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:50,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:50,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-14 01:41:50,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-14 01:41:50,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:50,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:41:51,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:51,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051798437] [2025-03-14 01:41:51,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051798437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:51,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:51,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:41:51,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793697847] [2025-03-14 01:41:51,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:51,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:41:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:51,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:41:51,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:41:51,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2025-03-14 01:41:51,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 468 transitions, 969 flow. Second operand has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 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-03-14 01:41:51,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:51,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2025-03-14 01:41:51,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:52,035 INFO L124 PetriNetUnfolderBase]: 320/1970 cut-off events. [2025-03-14 01:41:52,035 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-14 01:41:52,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2839 conditions, 1970 events. 320/1970 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10453 event pairs, 288 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 2373. Up to 808 conditions per place. [2025-03-14 01:41:52,042 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 104 selfloop transitions, 5 changer transitions 0/467 dead transitions. [2025-03-14 01:41:52,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 467 transitions, 1185 flow [2025-03-14 01:41:52,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:41:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:41:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2318 transitions. [2025-03-14 01:41:52,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782051282051282 [2025-03-14 01:41:52,047 INFO L175 Difference]: Start difference. First operand has 472 places, 468 transitions, 969 flow. Second operand 6 states and 2318 transitions. [2025-03-14 01:41:52,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 467 transitions, 1185 flow [2025-03-14 01:41:52,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 467 transitions, 1175 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:41:52,053 INFO L231 Difference]: Finished difference. Result has 471 places, 467 transitions, 967 flow [2025-03-14 01:41:52,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=967, PETRI_PLACES=471, PETRI_TRANSITIONS=467} [2025-03-14 01:41:52,055 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -5 predicate places. [2025-03-14 01:41:52,056 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 467 transitions, 967 flow [2025-03-14 01:41:52,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 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-03-14 01:41:52,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:52,057 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-03-14 01:41:52,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:41:52,057 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-03-14 01:41:52,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1594145177, now seen corresponding path program 1 times [2025-03-14 01:41:52,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:52,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446559531] [2025-03-14 01:41:52,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:52,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-14 01:41:52,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-14 01:41:52,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:52,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 01:41:52,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:52,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446559531] [2025-03-14 01:41:52,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446559531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:41:52,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870748627] [2025-03-14 01:41:52,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:52,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:41:52,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:41:52,206 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:41:52,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:41:52,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-14 01:41:52,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-14 01:41:52,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:52,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:52,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:41:52,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:41:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 01:41:52,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:41:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 01:41:52,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870748627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:41:52,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:41:52,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:41:52,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698927534] [2025-03-14 01:41:52,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:41:52,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:41:52,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:52,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:41:52,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:41:52,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-14 01:41:52,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 467 transitions, 967 flow. Second operand has 10 states, 10 states have (on average 460.8) internal successors, (4608), 10 states have internal predecessors, (4608), 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-03-14 01:41:52,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:52,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-14 01:41:52,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:52,906 INFO L124 PetriNetUnfolderBase]: 15/999 cut-off events. [2025-03-14 01:41:52,906 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-14 01:41:52,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 999 events. 15/999 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1194 event pairs, 8 based on Foata normal form. 4/973 useless extension candidates. Maximal degree in co-relation 888. Up to 38 conditions per place. [2025-03-14 01:41:52,908 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 19 selfloop transitions, 9 changer transitions 0/475 dead transitions. [2025-03-14 01:41:52,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 475 transitions, 1041 flow [2025-03-14 01:41:52,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:41:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:41:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4161 transitions. [2025-03-14 01:41:52,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2025-03-14 01:41:52,914 INFO L175 Difference]: Start difference. First operand has 471 places, 467 transitions, 967 flow. Second operand 9 states and 4161 transitions. [2025-03-14 01:41:52,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 475 transitions, 1041 flow [2025-03-14 01:41:52,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 475 transitions, 1031 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:41:52,921 INFO L231 Difference]: Finished difference. Result has 477 places, 473 transitions, 1007 flow [2025-03-14 01:41:52,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1007, PETRI_PLACES=477, PETRI_TRANSITIONS=473} [2025-03-14 01:41:52,922 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 1 predicate places. [2025-03-14 01:41:52,922 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 473 transitions, 1007 flow [2025-03-14 01:41:52,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 460.8) internal successors, (4608), 10 states have internal predecessors, (4608), 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-03-14 01:41:52,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:52,924 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-03-14 01:41:52,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 01:41:53,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-14 01:41:53,125 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-03-14 01:41:53,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:53,126 INFO L85 PathProgramCache]: Analyzing trace with hash -562622987, now seen corresponding path program 2 times [2025-03-14 01:41:53,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:53,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088701260] [2025-03-14 01:41:53,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:41:53,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:53,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 422 statements into 2 equivalence classes. [2025-03-14 01:41:53,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 123 of 422 statements. [2025-03-14 01:41:53,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:41:53,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2025-03-14 01:41:53,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:53,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088701260] [2025-03-14 01:41:53,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088701260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:53,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:53,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:41:53,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988522890] [2025-03-14 01:41:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:53,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:41:53,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:53,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:41:53,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:41:54,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 494 [2025-03-14 01:41:54,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 473 transitions, 1007 flow. Second operand has 6 states, 6 states have (on average 404.3333333333333) internal successors, (2426), 6 states have internal predecessors, (2426), 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-03-14 01:41:54,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:54,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 494 [2025-03-14 01:41:54,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:54,563 INFO L124 PetriNetUnfolderBase]: 83/1311 cut-off events. [2025-03-14 01:41:54,563 INFO L125 PetriNetUnfolderBase]: For 18/22 co-relation queries the response was YES. [2025-03-14 01:41:54,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 1311 events. 83/1311 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3072 event pairs, 64 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 1087. Up to 362 conditions per place. [2025-03-14 01:41:54,566 INFO L140 encePairwiseOnDemand]: 482/494 looper letters, 69 selfloop transitions, 10 changer transitions 0/471 dead transitions. [2025-03-14 01:41:54,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 471 transitions, 1161 flow [2025-03-14 01:41:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:41:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:41:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2463 transitions. [2025-03-14 01:41:54,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8309716599190283 [2025-03-14 01:41:54,569 INFO L175 Difference]: Start difference. First operand has 477 places, 473 transitions, 1007 flow. Second operand 6 states and 2463 transitions. [2025-03-14 01:41:54,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 471 transitions, 1161 flow [2025-03-14 01:41:54,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 471 transitions, 1155 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:41:54,575 INFO L231 Difference]: Finished difference. Result has 479 places, 471 transitions, 1017 flow [2025-03-14 01:41:54,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1017, PETRI_PLACES=479, PETRI_TRANSITIONS=471} [2025-03-14 01:41:54,576 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 3 predicate places. [2025-03-14 01:41:54,576 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 471 transitions, 1017 flow [2025-03-14 01:41:54,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.3333333333333) internal successors, (2426), 6 states have internal predecessors, (2426), 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-03-14 01:41:54,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:54,578 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-03-14 01:41:54,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:41:54,578 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-03-14 01:41:54,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1765512560, now seen corresponding path program 1 times [2025-03-14 01:41:54,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:54,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112708314] [2025-03-14 01:41:54,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:54,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-14 01:41:54,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-14 01:41:54,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:54,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2025-03-14 01:41:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:54,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112708314] [2025-03-14 01:41:54,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112708314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:41:54,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447169956] [2025-03-14 01:41:54,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:54,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:41:54,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:41:54,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:41:54,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:41:55,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-14 01:41:55,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-14 01:41:55,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:55,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:55,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:41:55,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:41:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 1 proven. 399 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-14 01:41:55,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:41:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 1 proven. 399 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-14 01:41:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447169956] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:41:55,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:41:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-14 01:41:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78116678] [2025-03-14 01:41:55,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:41:55,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 01:41:55,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:55,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 01:41:55,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 01:41:55,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 494 [2025-03-14 01:41:55,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 471 transitions, 1017 flow. Second operand has 19 states, 19 states have (on average 455.5263157894737) internal successors, (8655), 19 states have internal predecessors, (8655), 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-03-14 01:41:55,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:55,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 494 [2025-03-14 01:41:55,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:57,072 INFO L124 PetriNetUnfolderBase]: 16/2377 cut-off events. [2025-03-14 01:41:57,073 INFO L125 PetriNetUnfolderBase]: For 81/82 co-relation queries the response was YES. [2025-03-14 01:41:57,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 2377 events. 16/2377 cut-off events. For 81/82 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1188 event pairs, 8 based on Foata normal form. 13/2362 useless extension candidates. Maximal degree in co-relation 2450. Up to 40 conditions per place. [2025-03-14 01:41:57,076 INFO L140 encePairwiseOnDemand]: 483/494 looper letters, 51 selfloop transitions, 68 changer transitions 0/557 dead transitions. [2025-03-14 01:41:57,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 557 transitions, 1665 flow [2025-03-14 01:41:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-14 01:41:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-14 01:41:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 28671 transitions. [2025-03-14 01:41:57,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212454212454212 [2025-03-14 01:41:57,099 INFO L175 Difference]: Start difference. First operand has 479 places, 471 transitions, 1017 flow. Second operand 63 states and 28671 transitions. [2025-03-14 01:41:57,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 557 transitions, 1665 flow [2025-03-14 01:41:57,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 557 transitions, 1645 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:41:57,106 INFO L231 Difference]: Finished difference. Result has 552 places, 533 transitions, 1517 flow [2025-03-14 01:41:57,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1517, PETRI_PLACES=552, PETRI_TRANSITIONS=533} [2025-03-14 01:41:57,107 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 76 predicate places. [2025-03-14 01:41:57,108 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 533 transitions, 1517 flow [2025-03-14 01:41:57,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 455.5263157894737) internal successors, (8655), 19 states have internal predecessors, (8655), 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-03-14 01:41:57,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:57,114 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-03-14 01:41:57,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:41:57,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-14 01:41:57,315 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-03-14 01:41:57,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:57,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1780035740, now seen corresponding path program 2 times [2025-03-14 01:41:57,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:57,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765782017] [2025-03-14 01:41:57,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:41:57,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:57,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1484 statements into 2 equivalence classes. [2025-03-14 01:41:57,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 166 of 1484 statements. [2025-03-14 01:41:57,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:41:57,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12365 trivial. 0 not checked. [2025-03-14 01:41:57,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:57,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765782017] [2025-03-14 01:41:57,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765782017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:57,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:57,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:41:57,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088011058] [2025-03-14 01:41:57,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:57,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:41:57,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:57,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:41:57,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:41:58,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 494 [2025-03-14 01:41:58,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 533 transitions, 1517 flow. Second operand has 6 states, 6 states have (on average 413.3333333333333) internal successors, (2480), 6 states have internal predecessors, (2480), 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-03-14 01:41:58,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:58,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 494 [2025-03-14 01:41:58,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:58,830 INFO L124 PetriNetUnfolderBase]: 103/2776 cut-off events. [2025-03-14 01:41:58,830 INFO L125 PetriNetUnfolderBase]: For 441/446 co-relation queries the response was YES. [2025-03-14 01:41:58,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3946 conditions, 2776 events. 103/2776 cut-off events. For 441/446 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4010 event pairs, 80 based on Foata normal form. 0/2694 useless extension candidates. Maximal degree in co-relation 3132. Up to 823 conditions per place. [2025-03-14 01:41:58,837 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 66 selfloop transitions, 5 changer transitions 0/532 dead transitions. [2025-03-14 01:41:58,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 532 transitions, 1657 flow [2025-03-14 01:41:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:41:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:41:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2508 transitions. [2025-03-14 01:41:58,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2025-03-14 01:41:58,839 INFO L175 Difference]: Start difference. First operand has 552 places, 533 transitions, 1517 flow. Second operand 6 states and 2508 transitions. [2025-03-14 01:41:58,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 532 transitions, 1657 flow [2025-03-14 01:41:58,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 532 transitions, 1581 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-14 01:41:58,848 INFO L231 Difference]: Finished difference. Result has 549 places, 532 transitions, 1449 flow [2025-03-14 01:41:58,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1449, PETRI_PLACES=549, PETRI_TRANSITIONS=532} [2025-03-14 01:41:58,849 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 73 predicate places. [2025-03-14 01:41:58,849 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 532 transitions, 1449 flow [2025-03-14 01:41:58,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 413.3333333333333) internal successors, (2480), 6 states have internal predecessors, (2480), 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-03-14 01:41:58,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:58,850 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-03-14 01:41:58,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:41:58,850 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-03-14 01:41:58,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1761338453, now seen corresponding path program 1 times [2025-03-14 01:41:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:58,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095667412] [2025-03-14 01:41:58,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:58,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:59,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-14 01:41:59,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-14 01:41:59,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:59,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 6508 proven. 2779 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2025-03-14 01:42:01,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:01,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095667412] [2025-03-14 01:42:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095667412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:42:01,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643704500] [2025-03-14 01:42:01,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:01,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:42:01,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:42:01,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:42:01,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:42:01,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-14 01:42:02,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-14 01:42:02,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:02,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:02,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 5801 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:42:02,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:42:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 6508 proven. 2779 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2025-03-14 01:42:02,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:42:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 6508 proven. 2779 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2025-03-14 01:42:03,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643704500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:42:03,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:42:03,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-14 01:42:03,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451083492] [2025-03-14 01:42:03,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:42:03,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 01:42:03,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:03,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 01:42:03,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 01:42:03,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-14 01:42:03,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 532 transitions, 1449 flow. Second operand has 34 states, 34 states have (on average 461.11764705882354) internal successors, (15678), 34 states have internal predecessors, (15678), 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-03-14 01:42:03,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:03,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-14 01:42:03,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:05,308 INFO L124 PetriNetUnfolderBase]: 16/4536 cut-off events. [2025-03-14 01:42:05,309 INFO L125 PetriNetUnfolderBase]: For 3212/3213 co-relation queries the response was YES. [2025-03-14 01:42:05,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5332 conditions, 4536 events. 16/4536 cut-off events. For 3212/3213 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1187 event pairs, 8 based on Foata normal form. 24/4533 useless extension candidates. Maximal degree in co-relation 5088. Up to 78 conditions per place. [2025-03-14 01:42:05,317 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 51 selfloop transitions, 135 changer transitions 0/633 dead transitions. [2025-03-14 01:42:05,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 633 transitions, 2585 flow [2025-03-14 01:42:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 01:42:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 01:42:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 20739 transitions. [2025-03-14 01:42:05,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9329284750337382 [2025-03-14 01:42:05,327 INFO L175 Difference]: Start difference. First operand has 549 places, 532 transitions, 1449 flow. Second operand 45 states and 20739 transitions. [2025-03-14 01:42:05,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 633 transitions, 2585 flow [2025-03-14 01:42:05,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 633 transitions, 2575 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:42:05,338 INFO L231 Difference]: Finished difference. Result has 597 places, 607 transitions, 2313 flow [2025-03-14 01:42:05,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2313, PETRI_PLACES=597, PETRI_TRANSITIONS=607} [2025-03-14 01:42:05,341 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 121 predicate places. [2025-03-14 01:42:05,341 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 607 transitions, 2313 flow [2025-03-14 01:42:05,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 461.11764705882354) internal successors, (15678), 34 states have internal predecessors, (15678), 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-03-14 01:42:05,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:05,345 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-03-14 01:42:05,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:42:05,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:42:05,546 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-03-14 01:42:05,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1371626923, now seen corresponding path program 2 times [2025-03-14 01:42:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971887892] [2025-03-14 01:42:05,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:42:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:05,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2931 statements into 2 equivalence classes. [2025-03-14 01:42:05,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 173 of 2931 statements. [2025-03-14 01:42:05,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:42:05,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 58141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58141 trivial. 0 not checked. [2025-03-14 01:42:06,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:06,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971887892] [2025-03-14 01:42:06,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971887892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:06,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:06,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:42:06,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802433913] [2025-03-14 01:42:06,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:06,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:42:06,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:06,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:42:06,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:42:06,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2025-03-14 01:42:06,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 607 transitions, 2313 flow. Second operand has 6 states, 6 states have (on average 378.1666666666667) internal successors, (2269), 6 states have internal predecessors, (2269), 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-03-14 01:42:06,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:06,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2025-03-14 01:42:06,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:09,021 INFO L124 PetriNetUnfolderBase]: 360/5838 cut-off events. [2025-03-14 01:42:09,021 INFO L125 PetriNetUnfolderBase]: For 1234/1243 co-relation queries the response was YES. [2025-03-14 01:42:09,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8836 conditions, 5838 events. 360/5838 cut-off events. For 1234/1243 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 11869 event pairs, 324 based on Foata normal form. 0/5706 useless extension candidates. Maximal degree in co-relation 6602. Up to 2196 conditions per place. [2025-03-14 01:42:09,033 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 104 selfloop transitions, 5 changer transitions 0/606 dead transitions. [2025-03-14 01:42:09,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 606 transitions, 2529 flow [2025-03-14 01:42:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:42:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:42:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2318 transitions. [2025-03-14 01:42:09,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782051282051282 [2025-03-14 01:42:09,035 INFO L175 Difference]: Start difference. First operand has 597 places, 607 transitions, 2313 flow. Second operand 6 states and 2318 transitions. [2025-03-14 01:42:09,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 606 transitions, 2529 flow [2025-03-14 01:42:09,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 606 transitions, 2421 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-14 01:42:09,049 INFO L231 Difference]: Finished difference. Result has 583 places, 606 transitions, 2213 flow [2025-03-14 01:42:09,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2213, PETRI_PLACES=583, PETRI_TRANSITIONS=606} [2025-03-14 01:42:09,050 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 107 predicate places. [2025-03-14 01:42:09,050 INFO L471 AbstractCegarLoop]: Abstraction has has 583 places, 606 transitions, 2213 flow [2025-03-14 01:42:09,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 378.1666666666667) internal successors, (2269), 6 states have internal predecessors, (2269), 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-03-14 01:42:09,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:09,051 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-03-14 01:42:09,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:42:09,051 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-03-14 01:42:09,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash 172510926, now seen corresponding path program 1 times [2025-03-14 01:42:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:09,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277252404] [2025-03-14 01:42:09,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:09,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:09,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-14 01:42:09,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-14 01:42:09,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:09,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 58141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58141 trivial. 0 not checked. [2025-03-14 01:42:12,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:12,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277252404] [2025-03-14 01:42:12,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277252404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:12,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:12,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:42:12,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066140736] [2025-03-14 01:42:12,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:12,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:12,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:12,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:12,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-14 01:42:12,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 606 transitions, 2213 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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-03-14 01:42:12,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:12,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-14 01:42:12,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:14,252 INFO L124 PetriNetUnfolderBase]: 46/4808 cut-off events. [2025-03-14 01:42:14,252 INFO L125 PetriNetUnfolderBase]: For 1202/1206 co-relation queries the response was YES. [2025-03-14 01:42:14,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5644 conditions, 4808 events. 46/4808 cut-off events. For 1202/1206 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3040 event pairs, 24 based on Foata normal form. 2/4741 useless extension candidates. Maximal degree in co-relation 5041. Up to 78 conditions per place. [2025-03-14 01:42:14,259 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 22 selfloop transitions, 2 changer transitions 0/614 dead transitions. [2025-03-14 01:42:14,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 614 transitions, 2277 flow [2025-03-14 01:42:14,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1411 transitions. [2025-03-14 01:42:14,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520917678812416 [2025-03-14 01:42:14,260 INFO L175 Difference]: Start difference. First operand has 583 places, 606 transitions, 2213 flow. Second operand 3 states and 1411 transitions. [2025-03-14 01:42:14,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 614 transitions, 2277 flow [2025-03-14 01:42:14,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 614 transitions, 2267 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:42:14,274 INFO L231 Difference]: Finished difference. Result has 581 places, 606 transitions, 2211 flow [2025-03-14 01:42:14,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2211, PETRI_PLACES=581, PETRI_TRANSITIONS=606} [2025-03-14 01:42:14,275 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 105 predicate places. [2025-03-14 01:42:14,275 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 606 transitions, 2211 flow [2025-03-14 01:42:14,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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-03-14 01:42:14,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:14,277 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-03-14 01:42:14,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:42:14,277 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-03-14 01:42:14,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:14,284 INFO L85 PathProgramCache]: Analyzing trace with hash 109410050, now seen corresponding path program 1 times [2025-03-14 01:42:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:14,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724867948] [2025-03-14 01:42:14,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:14,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:14,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-14 01:42:14,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-14 01:42:14,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:14,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 58141 backedges. 29756 proven. 13875 refuted. 0 times theorem prover too weak. 14510 trivial. 0 not checked. [2025-03-14 01:42:24,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:24,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724867948] [2025-03-14 01:42:24,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724867948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:42:24,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60740006] [2025-03-14 01:42:24,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:24,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:42:24,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:42:24,749 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:42:24,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:42:25,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-14 01:42:26,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-14 01:42:26,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:26,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:26,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 11747 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 01:42:26,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:42:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 58141 backedges. 29756 proven. 13875 refuted. 0 times theorem prover too weak. 14510 trivial. 0 not checked. [2025-03-14 01:42:27,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:42:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 58141 backedges. 29756 proven. 13875 refuted. 0 times theorem prover too weak. 14510 trivial. 0 not checked. [2025-03-14 01:42:29,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60740006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:42:29,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:42:29,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-14 01:42:29,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526547622] [2025-03-14 01:42:29,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:42:29,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-14 01:42:29,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:29,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-14 01:42:29,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-14 01:42:29,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-14 01:42:29,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 606 transitions, 2211 flow. Second operand has 63 states, 63 states have (on average 461.0952380952381) internal successors, (29049), 63 states have internal predecessors, (29049), 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-03-14 01:42:29,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:29,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-14 01:42:29,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:35,006 INFO L124 PetriNetUnfolderBase]: 15/8582 cut-off events. [2025-03-14 01:42:35,006 INFO L125 PetriNetUnfolderBase]: For 13377/13378 co-relation queries the response was YES. [2025-03-14 01:42:35,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10497 conditions, 8582 events. 15/8582 cut-off events. For 13377/13378 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1226 event pairs, 8 based on Foata normal form. 45/8603 useless extension candidates. Maximal degree in co-relation 10223. Up to 168 conditions per place. [2025-03-14 01:42:35,018 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 96 selfloop transitions, 270 changer transitions 0/812 dead transitions. [2025-03-14 01:42:35,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 812 transitions, 5129 flow [2025-03-14 01:42:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-14 01:42:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-14 01:42:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 41461 transitions. [2025-03-14 01:42:35,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9325461088618984 [2025-03-14 01:42:35,052 INFO L175 Difference]: Start difference. First operand has 581 places, 606 transitions, 2211 flow. Second operand 90 states and 41461 transitions. [2025-03-14 01:42:35,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 812 transitions, 5129 flow [2025-03-14 01:42:35,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 812 transitions, 5125 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:35,079 INFO L231 Difference]: Finished difference. Result has 684 places, 744 transitions, 4199 flow [2025-03-14 01:42:35,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4199, PETRI_PLACES=684, PETRI_TRANSITIONS=744} [2025-03-14 01:42:35,081 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 208 predicate places. [2025-03-14 01:42:35,081 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 744 transitions, 4199 flow [2025-03-14 01:42:35,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 461.0952380952381) internal successors, (29049), 63 states have internal predecessors, (29049), 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-03-14 01:42:35,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:35,088 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 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-03-14 01:42:35,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:42:35,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-14 01:42:35,290 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-14 01:42:35,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:35,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1758399554, now seen corresponding path program 2 times [2025-03-14 01:42:35,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:35,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463697870] [2025-03-14 01:42:35,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:42:35,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:35,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5645 statements into 2 equivalence classes. [2025-03-14 01:42:35,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 185 of 5645 statements. [2025-03-14 01:42:35,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:42:35,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 236314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236314 trivial. 0 not checked. [2025-03-14 01:42:36,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:36,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463697870] [2025-03-14 01:42:36,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463697870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:36,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:36,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:42:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736977945] [2025-03-14 01:42:36,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:36,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:42:36,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:36,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:42:36,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:42:36,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 494 [2025-03-14 01:42:36,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 744 transitions, 4199 flow. Second operand has 6 states, 6 states have (on average 376.8333333333333) internal successors, (2261), 6 states have internal predecessors, (2261), 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-03-14 01:42:36,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:36,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 494 [2025-03-14 01:42:36,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:46,549 INFO L124 PetriNetUnfolderBase]: 739/11137 cut-off events. [2025-03-14 01:42:46,549 INFO L125 PetriNetUnfolderBase]: For 3557/3571 co-relation queries the response was YES. [2025-03-14 01:42:46,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17531 conditions, 11137 events. 739/11137 cut-off events. For 3557/3571 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 22704 event pairs, 323 based on Foata normal form. 4/10894 useless extension candidates. Maximal degree in co-relation 13194. Up to 4140 conditions per place. [2025-03-14 01:42:46,578 INFO L140 encePairwiseOnDemand]: 459/494 looper letters, 143 selfloop transitions, 118 changer transitions 0/893 dead transitions. [2025-03-14 01:42:46,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 893 transitions, 5020 flow [2025-03-14 01:42:46,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:42:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:42:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2458 transitions. [2025-03-14 01:42:46,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8292847503373819 [2025-03-14 01:42:46,580 INFO L175 Difference]: Start difference. First operand has 684 places, 744 transitions, 4199 flow. Second operand 6 states and 2458 transitions. [2025-03-14 01:42:46,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 893 transitions, 5020 flow [2025-03-14 01:42:46,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 893 transitions, 4666 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-14 01:42:46,612 INFO L231 Difference]: Finished difference. Result has 652 places, 861 transitions, 4620 flow [2025-03-14 01:42:46,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=3845, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4620, PETRI_PLACES=652, PETRI_TRANSITIONS=861} [2025-03-14 01:42:46,613 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 176 predicate places. [2025-03-14 01:42:46,613 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 861 transitions, 4620 flow [2025-03-14 01:42:46,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 376.8333333333333) internal successors, (2261), 6 states have internal predecessors, (2261), 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-03-14 01:42:46,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:46,615 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:46,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:42:46,616 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-14 01:42:46,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:46,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1140597947, now seen corresponding path program 1 times [2025-03-14 01:42:46,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:46,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738311723] [2025-03-14 01:42:46,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:46,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:47,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5659 statements into 1 equivalence classes. [2025-03-14 01:42:47,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5659 of 5659 statements. [2025-03-14 01:42:47,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:47,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 236314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236314 trivial. 0 not checked. [2025-03-14 01:42:57,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:57,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738311723] [2025-03-14 01:42:57,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738311723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:57,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:57,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:42:57,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426887004] [2025-03-14 01:42:57,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:57,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:42:57,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:57,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:42:57,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:42:57,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 494 [2025-03-14 01:42:57,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 861 transitions, 4620 flow. Second operand has 5 states, 5 states have (on average 461.6) internal successors, (2308), 5 states have internal predecessors, (2308), 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-03-14 01:42:57,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:57,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 494 [2025-03-14 01:42:57,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand